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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Paperback. Etat : New. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. N° de réf. du vendeur 6666-IUK-9780521117906
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9780521117906
Quantité disponible : Plus de 20 disponibles
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. 136 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 8360984
Quantité disponible : 4 disponible(s)
Vendeur : Books Puddle, Woodside, NY, Etats-Unis
Etat : New. Print on Demand pp. 136. N° de réf. du vendeur 26535495
Quantité disponible : 4 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. In this book is presented the theoretical foundation of a higher-order logic programming language with equality, based on the clausal theory of types. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 136 pages, black & white illustrations. BIC Classification: UYA. Category: (P) Professional & Vocational. Dimension: 244 x 170 x 7. Weight in Grams: 230. . 2009. 1st Edition. paperback. . . . . N° de réf. du vendeur V9780521117906
Quantité disponible : Plus de 20 disponibles
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND pp. 136. N° de réf. du vendeur 18535501
Quantité disponible : 4 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In English. N° de réf. du vendeur ria9780521117906_new
Quantité disponible : Plus de 20 disponibles
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. N° de réf. du vendeur C9780521117906
Quantité disponible : Plus de 20 disponibles
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. In this book is presented the theoretical foundation of a higher-order logic programming language with equality, based on the clausal theory of types. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 136 pages, black & white illustrations. BIC Classification: UYA. Category: (P) Professional & Vocational. Dimension: 244 x 170 x 7. Weight in Grams: 230. . 2009. 1st Edition. paperback. . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9780521117906
Quantité disponible : Plus de 20 disponibles
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Paperback. Etat : new. Paperback. 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-Goedel 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. In this book is presented the theoretical foundation of a higher-order logic programming language with equality, based on the clausal theory of types. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9780521117906
Quantité disponible : 1 disponible(s)