Games and Full Abstraction f"or the Lazy X-calculus

We define a category of games E, and its extensional quotient E. A model of the lazy X-calculus, a type-free functional language based on evaluation to weak head normal form, is given in E, yielding an extensional model in E. This model is shown to be fully abstract with respect to applicative simulation. This is, so far as we know, the first purely semantic construction of a fully abstract model for a reflexively-typed sequential language.

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

[2]  Robin Milner.  Functions as Processes , 1990, ICALP.

[3]  Matthew Hennessy.  A Fully Abstract Denotational Model for Higher-Order Processes , 1994, Inf. Comput..

[4]  C.-H. Luke Ong,et al.  Full Abstraction in the Lazy Lambda Calculus , 1993, Inf. Comput..

[5]  Alley Stoughton,et al.  Fully abstract models of programming languages , 1986, Research Notes in Theoretical Computer Science.

[6]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[7]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[8]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[9]  Hanno Nickau.  Hereditarily Sequential Functionals , 1994, LFCS.

[10]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[11]  Douglas J. Howe.  Equality in lazy computation systems , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[12]  C.-H. Luke Ong,et al.  Non-determinism in a functional setting , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

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

[14]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[15]  Alan Jeffrey,et al.  A fully abstract semantics for concurrent graph reduction , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

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

[17]  C.-H.L. Ong,et al.  Correspondence between operational and denotational semantics: the full abstraction problem for PCF , 1995, LICS 1995.