Consistency of the theory of contexts

The Theory of Contexts is a type-theoretic axiomatization aiming to give a metalogical account of the fundamental notions of variable and context as they appear in Higher Order Abstract Syntax. In this paper, we prove that this theory is consistent by building a model based on functor categories. By means of a suitable notion of forcing, we prove that this model validates Classical Higher Order Logic, the Theory of Contexts, and also (parametrised) structural induction and recursion principles over contexts. Our approach, which we present in full detail, should also be useful for reasoning on other models based on functor categories. Moreover, the construction could also be adopted, and possibly generalized, for validating other theories of names and binders.

[1]  Furio Honsell,et al.  A framework for defining logics , 1993, JACM.

[2]  Andrew M. Pitts,et al.  A new approach to abstract syntax involving binders , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[3]  J. Cheney,et al.  A sequent calculus for nominal logic , 2004, LICS 2004.

[4]  Stefan Berghofer,et al.  Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts , 2001, FoSSaCS.

[5]  I. Stark,et al.  A fully abstract domain model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[6]  Daniele Turi,et al.  Semantics of name and value passing , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

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

[8]  Bart Jacobs,et al.  Categorical Logic and Type Theory , 2001, Studies in logic and the foundations of mathematics.

[9]  I. Moerdijk,et al.  Sheaves in geometry and logic: a first introduction to topos theory , 1992 .

[10]  Furio Honsell,et al.  A Natural Deduction Approach to Dynamic Logic , 1995, TYPES.

[11]  Marino Miculan,et al.  Ambient Calculus and its Logic in the Calculus of Inductive Constructions , 2002, LFM.

[12]  E.,et al.  Tripos theory , 1980, Mathematical Proceedings of the Cambridge Philosophical Society.

[13]  Bart Jacobs,et al.  Parameters and Parametrization in Specification, Using Distributive Categories , 1995, Fundam. Informaticae.

[14]  Randy Pollack.  Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding , 2005 .

[15]  Marino Miculan.  Developing (Meta)Theory of Lambda-calculus in the Theory of Context , 2001, Electron. Notes Theor. Comput. Sci..

[16]  Andrew M. Pitts,et al.  Categorical logic , 2001, LICS 2001.

[17]  Frank Pfenning,et al.  System Description: Twelf - A Meta-Logical Framework for Deductive Systems , 1999, CADE.

[18]  Marino Miculan,et al.  Developing (Meta)Theory of λ-calculus in the Theory of Contexts1 1Work partially supported by Italian MURST project tosca and EC-WG types. , 2001 .

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

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

[21]  Ivan Scagnetto,et al.  Reasoning about Names In Higher-Order Abstract Syntax , 2002 .

[22]  Glynn Winskel,et al.  Presheaf Models for the pi-Calculus , 1997 .

[23]  Michael Barr,et al.  Category theory for computing science (2. ed.) , 1995, Prentice Hall international series in computer science.

[24]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[25]  Irène Guessarian,et al.  Algebraic semantics , 1981, Lecture Notes in Computer Science.

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

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

[28]  John C. Reynolds,et al.  The essence of ALGOL , 1997 .

[29]  Roy L. Crole,et al.  Basic Category Theory for Models of Syntax , 2003, Generic Programming.

[30]  BucaloAnna,et al.  Consistency of the theory of contexts , 2006 .

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

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

[33]  Roy L. Crole,et al.  Preface: Mechanised Reasoning about Languages with Variable Binding 2001 , 2001, Electron. Notes Theor. Comput. Sci..

[34]  Marino Miculan.  Developing ( Meta ) Theory of λ-calculus in the Theory of Contexts 1 , 2001 .

[35]  Furio Honsell,et al.  pi-calculus in (Co)inductive-type theory , 2001, Theor. Comput. Sci..

[36]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

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

[38]  Davide Sangiorgi,et al.  A Fully Abstract Model for the [pi]-calculus , 1996, Inf. Comput..

[39]  Martin Hofmann.  Semantical analysis of higher-order abstract syntax , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[40]  Amy P. Felty,et al.  Higher-Order Abstract Syntax in Coq , 1995, TLCA.

[41]  Ian David Bede Stark,et al.  Names and higher-order functions , 1994 .

[42]  Andrew M. Pitts.  Tripos Theory in Retrospect , 2002, Math. Struct. Comput. Sci..