Del 193 - Lecture Notes in Computer Science

Logics of Programs

Brooklyn, June 17-19, 1985

Häftad, Engelska, 1985

Av Rohit Parikh

739 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1985-06-01
Mått155 x 235 x 24 mm
Vikt657 g
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor428
Upplaga1985
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
EAN9783540156482

Du kanske också är intresserad av

Proof, Computation and Agency

Del 352

Proof, Computation and Agency

Johan van Benthem, Amitabha Gupta, Rohit Parikh, Johan Van Benthem, Johan Van Benthem

2 089 kr

Akrylfärg Simply 25 delar

Akrylfärg Simply 25 delar

Daler-Rowney

199 kr

Proof, Computation and Agency

Del 352

Proof, Computation and Agency

Johan van Benthem, Amitabha Gupta, Rohit Parikh, Johan Van Benthem, Johan Van Benthem

2 099 kr

Hjärtslag : En självbiografi

Nyhet

Hjärtslag : En självbiografi

Björn Borg, Patricia Borg

349 kr

Lera DAS 1kg vit

Lera DAS 1kg vit

DAS

89 kr

Lackeringskit DAS 75ml lack + pensel

Lackeringskit DAS 75ml lack + pensel

DAS

159 kr

Den yttersta hemligheten

Nyhet

Del 6

Den yttersta hemligheten

329 kr

Hitster Christmas

Nyhet

Hitster Christmas

Jumbo

259 kr

Modelleringsverktyg DAS trä 2-pack

Modelleringsverktyg DAS trä 2-pack

DAS

69 kr

Kvinnorna

4 pocket för 3

Kvinnorna

125 kr

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

Nonclausal temporal deduction.- Unsolvable terms in typed lambda calculus with fix-point operators: Extended abstract.- Lambda calculus with constrained types.- An axiomatic treatment of a parallel programming language.- Recursive definitions in type theory.- Errata.- Automata, tableaux, and temporal logics.- Proving termination of Prolog programs.- A Hoare Calculus for functions defined by recursion on higher types.- On the relative incompleteness of logics for total correctness.- From synchronization tree logic to acceptance model logic.- A FASE specification of FP.- On asymptotic probabilities of inductive queries and their decision problem.- Compositional semantics for real-time distributed computing.- Partial-correctness theories as first-order theories.- The glory of the past.- Continuation semantics in typed lambda-calculi.- Second-order logical relations.- Behavior: a temporal appreach to process modeling.- Equational logic as a programming language: Abstract.- Distributed processes and the logic of knowledge.- Some constructions for order-theoretic models of concurrency.- Proving fairness of schedulers.- The reasoning powers of Burstall's (modal logic) and Pnueli's (temporal logic) program verification methods.- A partial correctness logic for procedures.- A proof system for Distributed Processes.- Fixpoints and program looping: Reductions from the Propositional mu-calculus into Propositional Dynamic Logics of Looping.- Semantical analysis of specification logic.- A simple programming language with data types: semantics and verification.- Computer aided reasoning.- The taming of converse: Reasoning about two-way computations.