Mohlo by se vám také líbit

Více informací o knize Clausal Theory of Types

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 105 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer science Mathematical theory of computation

• Plný název: Clausal Theory of Types
• Autor: D. A. Wolfram
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 136
• EAN: 9780521117906
• ISBN: 0521117909
• ID: 02022653
• Nakladatelství: Cambridge University Press
• Hmotnost: 230 g
• Rozměry: 244 × 170 × 7 mm
• Datum vydání: 30. July 2009

Oblíbené z jiného soudku

---

---

---