menu
{ "item_title" : "The Clausal Theory of Types", "item_author" : [" D. A. Wolfram "], "item_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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/0/52/111/790/0521117909_b.jpg", "price_data" : { "retail_price" : "39.00", "online_price" : "39.00", "our_price" : "39.00", "club_price" : "39.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
The Clausal Theory of Types|D. A. Wolfram

The Clausal Theory of Types

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9780521117906
  • ISBN-10: 0521117909
  • Publisher: Cambridge University Press
  • Publish Date: July 2009
  • Dimensions: 9.61 x 6.69 x 0.29 inches
  • Shipping Weight: 0.5 pounds
  • Page Count: 136

Related Categories

You May Also Like...

    1

BAM Customer Reviews