Skip to Main content Skip to Navigation

Programming with Higher-Order Logic

Dale Miller 1, 2 Nadathur Gopalan 3
1 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
3 Department of Computer Science
Department of Computer Science
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.
Document type :
Complete list of metadata
Contributor : Dale Miller Connect in order to contact the contributor
Submitted on : Tuesday, January 15, 2013 - 11:18:21 AM
Last modification on : Saturday, February 27, 2021 - 4:02:05 PM




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



Les métriques sont temporairement indisponibles