About this product

Product Identifiers

PublisherCambridge University Press

ISBN-100521395607

ISBN-139780521395601

eBay Product ID (ePID)965506

Product Key Features

Number of Pages320 Pages

LanguageEnglish

Publication NameLogic and Computation : Interactive Proof with Cambridge Lcf

Publication Year1990

SubjectProgramming Languages / General, Logic

TypeTextbook

Subject AreaMathematics, Computers

AuthorL. C. Paulson

SeriesCambridge Tracts in Theoretical Computer Science Ser.

FormatTrade Paperback

Dimensions

Item Height0.7 in

Item Weight20.4 Oz

Item Length9.7 in

Item Width7.4 in

Additional Product Features

Intended AudienceScholarly & Professional

Reviews"This book is well-written: it is a good text for any reader who wants to become familiar with Cambridge LCF, or, in general, with machine assisted (formal) proof construction." Mathematical Reviews

Dewey Edition19

Series Volume NumberSeries Number 2

IllustratedYes

Dewey Decimal005.1

Table Of ContentPart 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.

SynopsisThis 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., Logic and Computation 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 methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of statements in a programming language. This book consists of two parts. Part I outlines the mathematical preliminaries: elementary logic and domain theory. They are explained at an intuitive level, giving references to more advanced reading. Part II provides enough 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 study of techniques for formal theorem-proving focuses on the applications of Cambridge LCF (Logic for Computable Functions), a computer program for reasoning about computation.

LC Classification NumberQA9.59 .P38 1987