Logic and Computation

Interactive Proof with Cambridge LCF

Lawrence C. Paulson (Autor)

Buch | Hardcover

320 Seiten

1987
Cambridge University Press (Verlag)
978-0-521-34632-0 (ISBN)

Titel erscheint in neuer Auflage

Artikel merken

This book is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines the methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of program statements. Cambridge LCF is based on an earlier theorem-proving system, Edinburgh LCF, which introduced a design that gives the user flexibility to use and extend the system. A goal of this book is to explain the design, which has been adopted in several other systems. The book consists of two parts. Part I outlines the mathematical preliminaries, elementary logic and domain theory, and explains them at an intuitive level, giving reference to more advanced reading; Part II provides sufficient detail to serve as a reference manual for Cambridge LCF. It will also be a useful guide for implementors of other programs based on the LCF approach.

Part I. Preliminaries: 1. Survey and history of LCF; 2. Formal proof in first order logic; 3. A logic of computable functions; 4. Structural induction; Part II. Cambridge LCF: 5. Syntactic operators for PPL; 6. Theory structure; 7. Axioms and interference rules; 8. Tactics and tacticals; 9. Rewriting and simplification; 10. Sample proofs; Bibliography; Index.

Erscheint lt. Verlag	15.10.1987
Reihe/Serie	Cambridge Tracts in Theoretical Computer Science
Verlagsort	Cambridge
Sprache	englisch
Maße	174 x 247 mm
Gewicht	832 g
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
Themenwelt	Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre
ISBN-10	0-521-34632-0 / 0521346320
ISBN-13	978-0-521-34632-0 / 9780521346320
Zustand	Neuware