• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
The Clausal Theory of Types

The Clausal Theory of Types

Hardcover

Series: Cambridge Tracts in Theoretical Computer Science, Book 21

Programming

ISBN10: 0521395380
ISBN13: 9780521395380
Publisher: Cambridge University Press
Published: Apr 22 1993
Pages: 134
Weight: 1.00
Height: 0.38 Width: 7.00 Depth: 10.00
Language: English
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.

1 different editions

Also available

Also in

Programming