Logic and Computation
Interactive Proof with Cambridge LCF
Seiten
1990
Cambridge University Press (Verlag)
978-0-521-39560-1 (ISBN)
Cambridge University Press (Verlag)
978-0-521-39560-1 (ISBN)
A study of techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). The book is aimed at graduate students and researchers in theoretical computer science.
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.
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 | 26.7.1990 |
|---|---|
| Reihe/Serie | Cambridge Tracts in Theoretical Computer Science |
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 187 x 247 mm |
| Gewicht | 574 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Informatik ► Weitere Themen ► Hardware | |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| ISBN-10 | 0-521-39560-7 / 0521395607 |
| ISBN-13 | 978-0-521-39560-1 / 9780521395601 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
entwickle, drucke und baue deine DIY-Objekte
Buch | Hardcover (2023)
Hanser, Carl (Verlag)
CHF 48,95
