{"product_id":"the-clausal-theory-of-types","title":"The Clausal Theory of Types","description":"\u003cp\u003eLogic 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.\u003c\/p\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46646781444334,"sku":"9780521117906","price":45.36,"currency_code":"AUD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0630\/9612\/7726\/files\/9780521117906.jpg?v=1750161155","url":"https:\/\/bookland.com.au\/products\/the-clausal-theory-of-types","provider":"Book Land AU","version":"1.0","type":"link"}