Logics of Programs
Editat de Rohit Parikhen Limba Engleză Paperback – iun 1985
Preț: 329.14 lei
Preț vechi: 411.42 lei
-20%
Puncte Express: 494
Carte tipărită la comandă
Livrare economică 09-23 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540156482
ISBN-10: 3540156488
Pagini: 436
Ilustrații: VIII, 428 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1985
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540156488
Pagini: 436
Ilustrații: VIII, 428 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1985
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.