Logic and computation : interactive proof with Cambridge LCF
Author(s)
Bibliographic Information
Logic and computation : interactive proof with Cambridge LCF
（Cambridge tracts in theoretical computer science, 2）
Cambridge University Press, 1990, c1987
- : pbk
Available at / 15 libraries
-
No Libraries matched.
- Remove all filters.
Note
"First paperback edition 1990" -- t.p. verso
Bibliography: p. 289-295
Includes index
Description and Table of Contents
Description
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.
Table of Contents
- 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.
by "Nielsen BookData"
