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.
| ||||||||||||||||||
Book Description
Editorial Reviews
Review
"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
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
Cambridge LCF is an interactive theorem prover for reasoning about computable functions. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
thm list, previous subproof, strict sum, subgoal commands, classical contradiction rule, subgoal package, fixed point induction, type thm, exception tactic, lazy lists, isomorphism functions, subgoal list, congruence law, theorem continuations, exception syntax, backwards proof, theory file, strict lists, exhaustion property, resulting tactic, domain constructors, recursive domain equations, existential elimination, exhaustion rules, sticky types Key Phrases - Capitalized Phrases (CAPs): (learn more)
Modus Ponens, Dana Scott, Recall Example New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Cambridge LCF is an interactive theorem prover for reasoning about computable functions. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
thm list, previous subproof, strict sum, subgoal commands, classical contradiction rule, subgoal package, fixed point induction, type thm, exception tactic, lazy lists, isomorphism functions, subgoal list, congruence law, theorem continuations, exception syntax, backwards proof, theory file, strict lists, exhaustion property, resulting tactic, domain constructors, recursive domain equations, existential elimination, exhaustion rules, sticky types Key Phrases - Capitalized Phrases (CAPs): (learn more)
Modus Ponens, Dana Scott, Recall Example New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 23
books:
See all 23 books this book cites
- The Logical Basis for Computer Programming, Vol. 1: Deductive Reasoning by Zohar Manna in Back Matter
- Formal Language Theory: Perspectives and Open Problems by Ronald V. Book in Back Matter
- Correctness Problem in Computer Science (International lecture series in computer science) by Author Unknown in Back Matter
- Full Abstraction and Semantic Equivalence (ACM Doctoral Dissertation Award) by Ketan Mulmuley in Back Matter
- Computability and Logic by George S. Boolos in Back Matter
See all 23 books this book cites
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
