Get Free Shipping on orders over $79
The Clausal Theory of Types : Cambridge Tracts in Theoretical Computer Science - No Information Available

The Clausal Theory of Types

By: No Information Available

Hardcover | 21 June 1993

At a Glance

Hardcover


RRP $121.95

$111.75

or 4 interest-free payments of $27.94 with

 or 

Ships in 5 to 7 business days

Logic programming was based on first-order logic. Higher-order logics can also lead to theories of theorem-proving. This book introduces just such a theory, based on a lambda-calculus formulation of a clausal logic with equality, known as the Clausal Theory of Types. By restricting this logic to Horn clauses, a concise form of logic programming that incorporates functional programming is achieved. The book begins by reviewing the fundamental Skolem-Herbrand-G¶del Theorem and resolution, which are then extrapolated to a higher-order setting; this requires introducing higher-order equational unification which builds in higher-order equational theories and uses higher-order rewriting. The logic programming language derived has the unique property of being sound and complete with respect to Henkin-Andrews general models, and consequently of treating equivalent terms as identical. First published in 1993, the book can be used for graduate courses in theorem-proving, but will be of interest to all working in declarative programming.

Other Editions and Formats

Paperback

Published: 30th July 2009

More in Mathematical Theory of Computation

Discrete Mathematics for Computing : Grassroots - Peter Grossman

RRP $150.00

$129.75

13%
OFF
Applied Mathematics with F# - Sudipta Mukherjee
Axiomatic Set Theory : An Introduction - George Tourlakis