Games and definability for FPC

A new games model of the language FPC, a type theory with products, sums, function spaces and recursive types, is described. A definability result is proved, showing that every finite element of the model is the interpretation of some term of the language. ?

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

[2]  Samson Abramsky,et al.  Games and full abstraction for the lazy /spl lambda/-calculus , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[3]  Dominic J. D. Hughes.  Games and definability for system F , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[4]  Marcelo P. Fiore.  Axiomatic domain theory in categories of partial maps , 1994 .

[5]  Samson Abramsky,et al.  Call-by-Value Games , 1997, CSL.

[6]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[7]  C.-H. Luke Ong,et al.  A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

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

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

[10]  Guy McCusker.  Games and Full Abstraction for a Functional Metalanguage with Recursive Types , 1998, Distinguished Dissertations.

[11]  G. Winskel.  The formal semantics of programming languages , 1993 .

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

[13]  AbramskySamson,et al.  Games and full completeness for multiplicative linear logic , 1994 .

[14]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

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

[16]  Samson Abramsky,et al.  Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions , 1996, Electron. Notes Theor. Comput. Sci..

[17]  Nobuko Yoshida,et al.  Game-Theoretic Analysis of Call-by-Value Computation , 1997, Theor. Comput. Sci..

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

[19]  James Laird,et al.  Full abstraction for functional languages with control , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

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

[21]  François Lamarche.  Games semantics for full propositional linear logic , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.