| The Clausal Theory of Types Contributor(s): Wolfram, D. A. (Author) |
|
 |
ISBN: 0521117909 ISBN-13: 9780521117906 Publisher: Cambridge University Press OUR PRICE: $33.24 Product Type: Paperback - Other Formats Published: July 2009 Annotation: In this book is presented the theoretical foundation of a higher-order logic programming language with equality, based on the clausal theory of types. |
| Additional Information |
| BISAC Categories: - Computers | Programming - Object Oriented - Computers | Programming Languages - General |
| Dewey: 005.11 |
| Series: Cambridge Tracts in Theoretical Computer Science (Paperback) |
| Physical Information: 0.29" H x 6.69" W x 9.61" (0.50 lbs) 136 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |