Programming with higher-order logic /
"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 c...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
Cambridge :
Cambridge University Press,
2012.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | "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 [Lambda]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 [lambda]-terms and [pi]-calculus expressions can be encoded in [Lambda]Prolog"-- |
|---|---|
| Item Description: | Electronic resource. |
| Physical Description: | 1 online resource (pages cm.) |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 9781139518420 (electronic bk.) 1139518429 (electronic bk.) 9781139516570 (electronic bk.) 1139516574 (electronic bk.) 9786613685476 661368547X |