Mohlo by sa vám tiež páčiť

Viac informácií o knihe Clausal Theory of Types

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 110 bodov

Anotácia 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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer science Mathematical theory of computation

• Celý názov: Clausal Theory of Types
• Autor: D. A. Wolfram
• Jazyk: Angličtina
• Väzba: Brožovaná
• Počet strán: 136
• EAN: 9780521117906
• ISBN: 0521117909
• ID: 02022653
• Nakladateľ: Cambridge University Press
• Hmotnosť: 230 g
• Rozmery: 244 × 170 × 7 mm
• Dátum vydania: 30. July 2009

Obľúbené z iného súdka

---

---

---