Deductive and Declarative Programming
Deductive and Declarative Programming
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.
$59.00
USDIn this book, the author develops deduction-oriented methods for reasoning about functional and logic programs. The methods are based on the inductive theories of suitable data type specifications and exploit both classical theorem-proving and term rewriting. Detailed examples accompany the development of the methods, and their use is supported by a prototyping system that is documented at the end of the book.
Reviews & endorsements
"...promotes specification and programming on the basis of Horn logic with equality....His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming, neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system." Xiang Li, Mathematical Reviews
Product details
November 2006Paperback
9780521032513
288 pages
228 × 152 × 17 mm
0.469kg
Available
Table of Contents
- Introduction
- 1. Preliminaries
- 2. Guards, generators and constructors
- 3. Models and correctness
- 4. Computing goal solutions
- 5. Inductive expansion
- 6. Directed expansion and reduction
- 7. Implications of ground confluence
- 8. Examples
- 9. EXPANDER: inductive expansion in SML
- References
- Index.
