A proof theory for generic judgments: an extended abstract

A powerful and declarative means of specifying computations containing abstractions involves meta-level, universally quantified generic judgments. We present a proof theory for such judgments in which signatures are associated to each sequent (used to account for eigenvariables of sequent) and to each formula in the sequent (used to account for generic variables locally scoped over the formula). A new quantifier, /spl nabla/, is introduced to explicitly manipulate the local signature. Intuitionistic logic extended with /spl nabla/ satisfies cut-elimination even when the logic is additionally strengthened with a proof theoretic notion of definitions. The resulting logic can be used to encode naturally a number of examples involving name abstractions, and we illustrate using the /spl pi/-calculus and the encoding of object-level provability.

[1]  John C. Mitchell,et al.  A meta-notation for protocol analysis , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[2]  G. Kreisel.  The Collected Papers of Gerhard Gentzen , 1971 .

[3]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[4]  Dale Miller.  The pi-Calculus as a Theory in Linear Logic: Preliminary Results , 1992, ELP.

[5]  Dale Miller,et al.  Encoding Generic Judgments , 2002, FSTTCS.

[6]  Dale Miller,et al.  Encoding transition systems in sequent calculus , 2003, Theor. Comput. Sci..

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

[8]  Gerhard Gentzen,et al.  Investigations into Logical Deduction , 1970 .

[9]  Jawahar Chirimar,et al.  Proof theoretic approach to specification languages , 1995 .

[10]  T. Nipkom.  Functional unification of higher-order patterns , 1993, LICS 1993.

[11]  Dale Miller,et al.  Foundational aspects of syntax , 1999, CSUR.

[12]  Roy L. Crole,et al.  A Hybrid Encoding of Howe's Method for Establishing Congruence of Bisimilarity , 2002, Electron. Notes Theor. Comput. Sci..

[13]  Andrew M. Pitts,et al.  Nominal Logic: A First Order Theory of Names and Binding , 2001, TACS.

[14]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[15]  Dale Miller,et al.  Forum: A Multiple-Conclusion Specification Logic , 1996, Theor. Comput. Sci..

[16]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[17]  Dale Miller,et al.  Cut-elimination for a logic with definitions and induction , 2000, Theor. Comput. Sci..

[18]  Lars Hallnäs,et al.  A Proof-Theoretic Approach to Logic Programming. II. Programs as Definitions , 1991, J. Log. Comput..

[19]  Dale Miller,et al.  Lexical Scoping as Universal Quantification , 1989, ICLP.

[20]  Peter Schroeder-Heister.  Cut Elimination for Logics with Definitional Reflection , 1990, Nonclassical Logics and Information Processing.

[21]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[22]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[23]  Dale Miller,et al.  Unification Under a Mixed Prefix , 1992, J. Symb. Comput..

[24]  Tobias Nipkow,et al.  Functional unification of higher-order patterns , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[25]  Andrew M. Pitts,et al.  A First Order Theory of Names and Binding , 2001 .

[26]  Dale Miller,et al.  Reasoning with higher-order abstract syntax in a logical framework , 2000, TOCL.

[27]  Dale Miller,et al.  Reasoning in a logic with definitions and induction , 1997 .