## Logic of programming and calculi of discrete design: International Summer School directed by F.L. Bauer ... [et al.]This volume contains the proceedings of the NATO-sponsored Advanced Research Study Institute on Logic of Programming and Calculi of Discrete Design, held in continuation of the series of well-known summer schools in Marktoberdorf, July 29-August 10, 1986. The proceedings give an excellent overview of the state of the art in formal methods of program design. The book treats both logic in programming and formal calculi in the discrete design of programs and systems, including foundations of logic, equational logic, modal logics, support systems for logical reasoning, and design calculi for programs and program specifications. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Programming Calculi | 3 |

A Heuristic Explanation of Batchers Baffler | 43 |

Termination Conventions and Comparative Semantics | 79 |

Copyright | |

10 other sections not shown

### Other editions - View all

Logic of Programming and Calculi of Discrete Design: International Summer ... Manfred Broy No preview available - 2012 |

### Common terms and phrases

A-calculus abstract data types abstract types algorithm arity assume axioms behaviour Bintree bool Broy C.A.R. Hoare called circuit terms clausal sequents Combinatory Logic complete Computer Science conjunctive construct context defined definedness definition denote disjunction element End of Proof equations equivalent example expressions false finite formal formula function symbols given higher order homomorphism identity element implementation induction inference rules initial input Lemma logic loop LUSH resolution mathematical monotonic natural deduction natural numbers notation operator output pairs partial interpretation preconditions predicate logic primitive problem procedure clause programming language proof rules proof system proof theory properties propositional prove quantifiers recursive reduction regular interpretation relation resolution principle result satisfies semantics sequent signature sort static configuration strength strict strongest solution structural induction structure substitution term-generated termination theorem theory true unification unifier valid variables X-algebra X-homomorphism

### References to this book

Methods of Programming: Selected Papers on the CIP-Project Manfred Broy,Martin Wirsing Limited preview - 1991 |