Programming with Higher-Order Logic / Dale Miller, Gopalan Nadathur.
Material type: TextPublisher: Cambridge : Cambridge University Press, 2012Description: 1 online resource (320 pages) : digital, PDF file(s)Content type:- text
- computer
- online resource
- 9781139021326 (ebook)
- 005.1/15 23
- QA76.63 .M554 2012
Title from publisher's bibliographic system (viewed on 04 Apr 2016).
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.
There are no comments on this title.