Linear Abadi and Plotkin Logic

We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a wide collection of types, including existential types, inductive types, coinductive types and general recursive types. We show that the recursive types satisfy a universal property called dinaturality, and we develop reasoning principles for the constructed types. In the case of recursive types, the reasoning principle is a mixed induction/coinduction principle, with the curious property that coinduction holds for general relations, but induction only for a limited collection of ``admissible'' relations. A similar property was observed in Pitts' 1995 analysis of recursive types in domain theory. In a future paper we will develop a category theoretic notion of models of the logic presented here, and show how the results developed in the logic can be transferred to the models.

[1]  Martín Abadi,et al.  A Logic for Parametric Polymorphism , 1993, TLCA.

[2]  Axel Poigné,et al.  A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category , 1990, Theor. Comput. Sci..

[3]  Andrew M. Pitts,et al.  Relational Properties of Domains , 1996, Inf. Comput..

[4]  P. Freyd.  Algebraically complete categories , 1991 .

[5]  Rasmus Ejlers Møgelberg.  Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism , 2006, ICALP.

[6]  Giuseppe Rosolini,et al.  Using Synthetic Domain Theory to Prove Operational Properties of a Polymorphic Programming Language Based on Strictness , 2004 .

[7]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[8]  Izumi Takeuti.  An Axiomatic System of Parametricity , 1998, Fundam. Informaticae.

[9]  Rasmus Ejlers Møgelberg,et al.  Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic , 2005, MFPS.

[10]  Edmund Robinson,et al.  Reflexive graphs and parametric polymorphism , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[11]  Rasmus Ejlers Møgelberg,et al.  Parametric Domain-theoretic models of Linear Abadi & Plotkin Logic , 2005 .

[12]  LARS BIRKEDAL,et al.  Categorical Models for Abadi-Plotkin ’ s Logic for Parametricity , 2005 .

[13]  Philip Wadler,et al.  The Girard-Reynolds isomorphism (second edition) , 2007, Theor. Comput. Sci..

[14]  Daniele Turi,et al.  Axiomatic domain theory in categories of partial maps , 1998 .

[15]  J. Y. Girard,et al.  Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur , 1972 .

[16]  C. Pollard,et al.  Center for the Study of Language and Information , 2022 .

[17]  Claudio V. Russo,et al.  Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion , 2001, HOOTS.

[18]  Rasmus Ejlers Møgelberg,et al.  Relational Parametricity for Computational Effects , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[19]  Peter J. Freyd,et al.  Recursive types reduced to inductive types , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[20]  John C. Reynolds,et al.  On Functors Expressible in the Polymorphic Typed Lambda Calculus , 1993, Inf. Comput..

[21]  John C. Reynolds,et al.  Types, Abstraction and Parametric Polymorphism , 1983, IFIP Congress.

[23]  Benjamin C. Pierce,et al.  Types and programming languages: the next generation , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[24]  Andrew G. Barber,et al.  Linear type theories, semantics and action calculi , 1997 .

[25]  P. J. Freyd.  Applications of Categories in Computer Science: Remarks on algebraically compact categories , 1992 .