Using Synthetic Domain Theory to Prove Operational Properties of a Polymorphic Programming Language Based on Strictness

We present a simple and workable axiomatization of domain theory within intuitionistic set theory, in which predomains are (special) sets, and domains are algebras for a simple equational theory. We use the axioms to construct a relationally parametric set-theoretic model for a compact but powerful polymorphic programming language, given by a novel extension of intuitionistic linear type theory based on strictness. By applying the model, we establish the fundamental operational properties of the language.

[1]  Gordon D. Plotkin,et al.  Type theory and recursion , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[2]  Wesley Phoa,et al.  Two Results on Set-Theoretic Polymorphism , 1991, Category Theory and Computer Science.

[3]  Thomas Streicher,et al.  General synthetic domain theory – a logical approach , 1999 .

[4]  A. Scedrov.  Intuitionistic Set Theory , 1985 .

[5]  Andrew M. Pitts,et al.  A Note on Logical Relations Between Semantics and Syntax , 1997, Log. J. IGPL.

[6]  Alex K. Simpson,et al.  A uniform approach to domain theory in realizability models , 1997, Mathematical Structures in Computer Science.

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

[8]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[9]  Martin Hyland.  A small complete category , 1988, Ann. Pure Appl. Log..

[10]  Thomas Streicher,et al.  General synthetic domain theory – a logical approach , 1997, Mathematical Structures in Computer Science.

[11]  Wesley Phoa,et al.  Effective domains and intrinsic structure , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[12]  Roberto M. Amadio.  On the Adequacy of Per Models , 1993, MFCS.

[13]  J. Girard,et al.  Proofs and types , 1989 .

[14]  H. Friedman,et al.  Harvey Friedman's Research on the Foundations of Mathematics , 1985 .

[15]  J. Hyland.  First steps in synthetic domain theory , 1991 .

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

[17]  J. Hyland,et al.  The Discrete Objects in the Effective Topos , 1990 .

[18]  Gordon D. Plotkin,et al.  Complete axioms for categorical fixed-point operators , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[19]  Alex K. Simpson,et al.  Computational adequacy for recursive types in models of intuitionistic set theory , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[20]  Gordon D. Plotkin,et al.  Computational Effects and Operations: An Overview , 2004, Electron. Notes Theor. Comput. Sci..

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

[22]  Edmund Robinson,et al.  How complete is PER? , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.