Quantity:

More Buying Choices

Have one to sell? Sell yours here

Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

The Clausal Theory of Types (Cambridge Tracts in Theoretical Computer Science) [Hardcover]

D. A. Wolfram (Author)

Price:	$71.00 & this item ships for FREE with Super Saver Shipping. Details
Deal Price:
	o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

Usually ships within 1 to 3 weeks.
Ships from and sold by Amazon.com. Gift-wrap available.

FREE Two-Day Shipping for students on millions of items. Learn more

Formats	Amazon Price		New from	Used from
Hardcover	$71.00		--	--
Paperback	$28.99		--	--

Book Description

Publication Date: June 25, 1993 | ISBN-10: 0521395380 | ISBN-13: 978-0521395380 | Edition: First Edition

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.

#outer_postBodyPS { display: none; } #psGradient { display: none; } #psPlaceHolder { display: none; } #psExpand { display: none; } 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.

Editorial Reviews

Book Description

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, and derives a form of logic programming that incorporates functional programming. The book can be used for graduate courses in theorem-proving, but will be of interest to all working in declarative programming.

Product Details

Hardcover: 134 pages
Publisher: Cambridge University Press; First Edition edition (June 25, 1993)
Language: English
ISBN-10: 0521395380
ISBN-13: 978-0521395380
Product Dimensions: 9.7 x 7 x 0.5 inches
Shipping Weight: 14.9 ounces (View shipping rates and policies)
Amazon Best Sellers Rank: #4,682,554 in Books (See Top 100 in Books)

Would you like to update product info or give feedback on images?

More About the Author

› Visit Amazon's D. A. Wolfram Page

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

There are no customer reviews yet.

Create your own review

Video reviews

Amazon now allows customers to upload product video reviews. Use a webcam or video camera to record and upload reviews to Amazon.

Inside This Book (learn more)

First Sentence:
A semantics of logic programming can be derived from the Skolem-Herbrand-Godel Theorem of the first-order predicate calculus. Read the first page

Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
monoid problem, equational unification, full type hierarchy, disagreement pair, formula rewrite rules, closed literals, recurrent projection, goal clause, disagreement set, pattern matching problem, unification problem, extended polynomial, resolution theorem, unification procedure, equational theory, projection path, projection property, answer substitution, definite clause, matching tree, most general unifier, empty clause, closed terms, equational theories, compound instance

Key Phrases - Capitalized Phrases (CAPs): (learn more)
Clausal Theory of Types, Simple Theory of Types, Plotkin-Statman Conjecture, Hilbert's Tenth Problem, Logical Completeness, Lifting Lemma, Post's Correspondence Problem, Calculus of Constructions, Henkin's Completeness Theorem

New!
Books on Related Topics | Concordance | Text Stats

Citations (learn more)

This book cites 45 books:

Machine Intelligence by B. Meltzer in Back Matter (1), and Back Matter (2)
Introduction to Metamathematics (Bibliotheca Mathematica) by S.C. Kleene in Back Matter
Provability, Computability and Reflection, Volume 90 (Studies in Logic and the Foundations of Mathematics) by Lev D. Beklemishev in Back Matter
Belief Revision (Cambridge Tracts in Theoretical Computer Science) by Peter G�rdenfors in Front Matter
Introduction to Higher-Order Categorical Logic (Cambridge Studies in Advanced Mathematics) by J. Lambek in Back Matter

See all 45 books this book cites

37 books cite this book:

See all 37 books citing this book

Books on Related Topics (learn more)

Term Rewriting and All That by Franz Baader

Discusses:

Bounded Arithmetic, Propositional Logic and Complexity Theory by Jan Kraj�?ek

Discusses:

Rippling by Alan Bundy

Discusses:

Types in Logic Programming by Frank Pfenning

Discusses:

Tag this product

(What's this?)

Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

.jsOffDisplayBlock { display: block; } .jsOffDisplayInline { display: inline; } .jsOffVisibility { visibility: visible; } .jsOnDisplayBlock { display: none; } .jsOnDisplayNoneBlock { display: block; } .jsOnDisplayNoneInline { display: inline; } .jsOnDisplayInline { display: none; } .jsOnVisibility { visibility: hidden; } .jqOnDisplayBlock { display: none; } .jqOnDisplayInline { display: none; } .jqOnVisibility { visibility: hidden; } .jqOnDisplayNoneBlock { display: block; } .jqOnDisplayNoneInline { display: inline; }

Customer Discussions

This product's forum

Discussion	Replies	Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight

Start a new discussion

Topic:

First post:

Receive e-mail when new posts are made

Prompts for sign-in

Guidelines

Active discussions in related forums

Discussion	Replies	Latest Post
Science forum The planet earth is not round or flat....do you agree?	33	8 minutes ago
Science forum Can evolution produce The Supremes?	3	10 minutes ago
Science forum Why are people here so scientifically illiterate	8030	11 minutes ago
Science forum Why doesn't the expansion of the universe dillute the Higgs field?	77	1 hour ago
Science forum Neutrino Result explained!	16	1 hour ago
Science forum On the Predictive Value of Theory of Evolution Versus the Theory of God-Did-It	334	1 hour ago
Textbook forum Textbook Buyback	6	1 day ago
Textbook forum What is an a la carte textbook?	3	2 days ago