Sprache: Englisch
Verlag: Cambridge University Press, 2012
ISBN 10: 052187940X ISBN 13: 9780521879408
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 59,08
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
EUR 87,26
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 1st edition. 320 pages. 9.10x6.00x0.90 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2012
ISBN 10: 052187940X ISBN 13: 9780521879408
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 113,65
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. 2012. 1st Edition. Hardcover. A programming language based on a higher-order logic provides a declarative approach to capturing computations involving types, proofs and other syntactic structures. Num Pages: 320 pages, 81 b/w illus. BIC Classification: UM. Category: (U) Tertiary Education (US: College). Dimension: 237 x 160 x 23. Weight in Grams: 550. 320 pages, 81 b/w illus. A programming language based on a higher-order logic provides a declarative approach to capturing computations involving types, proofs and other syntactic structures. Cateogry: (U) Tertiary Education (US: College). BIC Classification: UM. Dimension: 237 x 160 x 23. Weight: 550. . . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press, 2012
ISBN 10: 052187940X ISBN 13: 9780521879408
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Formal systems that describe computations over syntactic structures occur frequently in computer science. Logic programming provides a natural framework for encoding and animating such systems. However, these systems often embody variable binding, a notion that must be treated carefully at a computational level. This book aims to show that a programming language based on a simply typed version of higher-order logic provides an elegant, declarative means for providing such a treatment. Three broad topics are covered in pursuit of this goal. First, a proof-theoretic framework that supports a general view of logic programming is identified. Second, an actual language called ¿Prolog is developed by applying this view to higher-order logic. Finally, a methodology for programming with specifications is exposed by showing how several computations over formal objects such as logical formulas, functional programs, and ¿-terms and ¿-calculus expressions can be encoded in ¿Prolog.