The Clausal Theory of Types Series Number 21: The Clausal Theory of Types
Afbeeldingen
Sla de afbeeldingen overArtikel vergelijken
Uitgever: Cambridge University Press
Auteur:
D.A. Wolfram
D. A. Wolfram
- Engels
- Hardcover
- 9780521395380
- 22 april 1993
- 134 pagina's
Samenvatting
In this book is presented the theoretical foundation of a higher-order logic programming language with equality, based on the clausal theory of types.
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.
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.
Productspecificaties
Wij vonden geen specificaties voor jouw zoekopdracht '{SEARCH}'.
Inhoud
- Taal
- en
- Bindwijze
- Hardcover
- Oorspronkelijke releasedatum
- 22 april 1993
- Aantal pagina's
- 134
- Illustraties
- Nee
Betrokkenen
- Hoofdauteur
- D.A. Wolfram
- Tweede Auteur
- D. A. Wolfram
- Hoofduitgeverij
- Cambridge University Press
Overige kenmerken
- Extra groot lettertype
- Nee
- Product breedte
- 184 mm
- Product hoogte
- 13 mm
- Product lengte
- 260 mm
- Studieboek
- Ja
- Verpakking breedte
- 177 mm
- Verpakking hoogte
- 11 mm
- Verpakking lengte
- 254 mm
- Verpakkingsgewicht
- 406 g
EAN
- EAN
- 9780521395380
Je vindt dit artikel in
- Categorieën
- Boek, ebook of luisterboek?
- Boek
- Taal
- Engels
- Beschikbaarheid
- Leverbaar
- Studieboek of algemeen
- Studieboeken
Kies gewenste uitvoering
Kies je bindwijze
(2)
Prijsinformatie en bestellen
De prijs van dit product is 74 euro en 99 cent.
2 - 3 weken
Verkoop door bol
- Prijs inclusief verzendkosten, verstuurd door bol
- Ophalen bij een bol afhaalpunt mogelijk
- 30 dagen bedenktijd en gratis retourneren
- Dag en nacht klantenservice
Anderen bekeken ook
Rapporteer dit artikel
Je wilt melding doen van illegale inhoud over dit artikel:
- Ik wil melding doen als klant
- Ik wil melding doen als autoriteit of trusted flagger
- Ik wil melding doen als partner
- Ik wil melding doen als merkhouder
Geen klant, autoriteit, trusted flagger, merkhouder of partner? Gebruik dan onderstaande link om melding te doen.