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 email@example.com providing details of the course you are teaching.
This book presents the theoretical foundation of a higher-order logic programming language with equality, based on the clausal theory of types. A long-sought goal of logic programming, the clausal theory of types is a logic programming language that allows functional computation as a primitive operation while having rigorous, sound, and complete declarative and operational semantics. The language is very powerful, supporting higher-order equational deduction and functional computation. Its higher order syntax makes it concise and expressive, abstract data types can be expressed in it, and searching for multiple solutions is a basic operation. The author proves a number of important and surprising results: a Skolem-Herbrand-Gödel theorem for higher-order logic; a Higher-Order Resolution Theorem, which includes as special cases some previously unproven conjectures about equational matching and higher-order matching.Read more
- Provides the foundation for a logic programming language
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: July 2009
- format: Paperback
- isbn: 9780521117906
- length: 136 pages
- dimensions: 244 x 170 x 7 mm
- weight: 0.23kg
- availability: Available
Table of Contents
2. Logic programming: a case study
3. Simply typed l-calculus
4. Higher-order logic
5. Higher-order equational unification
6. Higher-order equational logic programming.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in