Binding Logic: Proofs and Models

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there.

[1]  Pierre-Louis Curien.  Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.

[2]  Claude Kirchner,et al.  HOL-λσ: an intentional first-order expression of higher-order logic , 2001, Mathematical Structures in Computer Science.

[3]  Delia Kesner,et al.  Theory and applications of explicit substitutions: Introduction , 2001, Mathematical Structures in Computer Science.

[4]  Peter B. Andrews.  An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.

[5]  J. Lambek.  Deductive systems and categories II. Standard constructions and closed categories , 1969 .

[6]  Jean-Jacques Lévy,et al.  Confluence properties of weak and strong calculi of explicit substitutions , 1996, JACM.

[7]  Bruno Pagano,et al.  X.R.S : Explicit Reduction Systems - A First-Order Calculus for Higher-Order Calculi , 1998, CADE.

[8]  Claude Kirchner,et al.  Higher-order unification via explicit substitutions , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[9]  de Ng Dick Bruijn,et al.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[10]  Martín Abadi,et al.  Explicit substitutions , 1989, POPL '90.

[11]  Claude Kirchner,et al.  Theorem Proving Modulo , 2003, Journal of Automated Reasoning.

[12]  Bruno Pagano.  Des calculs de substitution explicite et de leur application a la compilation et de leur application a la compilation des langages fonctionnels , 1998 .

[13]  J. Roger Hindley.  Combinatory Reductions and Lambda Reductions Compared , 1977, Math. Log. Q..

[14]  Andrew Barber,et al.  Dual Intuitionistic Linear Logic , 1996 .

[15]  Gopalan Nadathur,et al.  A Logic Programming Approach to Manipulating Formulas and Programs , 1987, SLP.

[16]  Gilles Dowek,et al.  Proof normalization modulo , 1998, Journal of Symbolic Logic.

[17]  Leon Henkin,et al.  Completeness in the theory of types , 1950, Journal of Symbolic Logic.

[18]  Frank Pfenning,et al.  Higher-order abstract syntax , 1988, PLDI '88.

[19]  Gordon D. Plotkin,et al.  Abstract syntax and variable binding , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).