Picture 1 of 2

Stock photo

The Clausal Theory of Types Hardcover D. A. Wolfram - Picture 1 of 2

The Clausal Theory of Types Hardcover D. A. Wolfram - Picture 2 of 2

Cambridge Tracts in Theoretical Computer Science Ser.: Clausal Theory of Types by D. A. Wolfram (1993, Hardcover)

Better World Books (2860808)

99.2% positive feedback

Price:

$25.19

Free shipping

Estimated delivery Sat, Nov 1 - Thu, Nov 6

Returns:

30 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Very Good

Book

About this product

Product Identifiers

PublisherCambridge University Press

ISBN-100521395380

ISBN-139780521395380

eBay Product ID (ePID)648199

Product Key Features

Number of Pages134 Pages

LanguageEnglish

Publication NameClausal Theory of Types

Publication Year1993

SubjectProgramming Languages / General, Computer Science

TypeTextbook

AuthorD. A. Wolfram

Subject AreaComputers

SeriesCambridge Tracts in Theoretical Computer Science Ser.

FormatHardcover

Dimensions

Item Height0.4 in

Item Weight14.3 Oz

Item Length10 in

Item Width7 in

Additional Product Features

Intended AudienceScholarly & Professional

LCCN93-246461

Dewey Edition20

TitleLeadingThe

Series Volume NumberSeries Number 21

IllustratedYes

Dewey Decimal005.1/1

Table Of Content1. Introduction; 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.

SynopsisThis 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-Godel 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., 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., 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., 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.

LC Classification NumberQA76.63 .W64 1993