- We will send in 10–14 business days.
/images/books/3658812/9780521879408.jpg)
- Author: Dale Miller
- Publisher: Cambridge University Press
- ISBN-10: 052187940X
- ISBN-13: 9780521879408
- Format: 15.5 x 23.1 x 2.3 cm, kieti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.12:45:01
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Dale Miller
- Publisher: Cambridge University Press
- ISBN-10: 052187940X
- ISBN-13: 9780521879408
- Format: 15.5 x 23.1 x 2.3 cm, kieti viršeliai
- Language: English English
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.
Reviews