Programming with Higher-Order Logic - Archive ouverte HAL Access content directly
Books Year : 2012

Programming with Higher-Order Logic

(1, 2) , (3)
1
2
3

Abstract

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 and declarative means for realizing 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 a higher-order logic. Finally, a methodology for computing with specifications is exposed by showing how several computations over formal objects such as logical formulas, functional programs, λ-terms, and π-calculus expressions can be encoded in λProlog.
Not file

Dates and versions

hal-00776197 , version 1 (15-01-2013)

Identifiers

Cite

Dale Miller, Nadathur Gopalan. Programming with Higher-Order Logic. Cambridge University Press, pp.320, 2012, 9780521879408. ⟨10.1017/CBO9781139021326⟩. ⟨hal-00776197⟩
515 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More