Call-by-Value Games

A general construction of models of call-by-value from models of call-by-name computation is described. The construction makes essential use of the properties of sum types in common denotational models of call-by-name. When applied to categories of games, it yields fully abstract models of the call-by-value functional language PCFv, which can be extended to incorporate recursive types, and of a language with local references as in Standard ML.

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

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

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

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

[5]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[6]  Kurt Sieber,et al.  Relating Full Abstraction Results for Different Programming Languages , 1990, FSTTCS.

[7]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[8]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

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

[10]  Samson Abramsky,et al.  Full Abstraction for PCF1 , 1996 .

[11]  Edmund Robinson,et al.  Premonoidal categories and notions of computation , 1997, Mathematical Structures in Computer Science.

[12]  John C. Reynolds,et al.  Syntactic control of interference , 1978, POPL.

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

[14]  Andrew M. Pitts,et al.  Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? , 1993, MFCS.

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

[16]  Gordon D. Plotkin,et al.  An axiomatisation of computationally adequate domain theoretic models of FPC , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

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

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

[19]  Bart Jacobs,et al.  Semantics of Weakening and Contraction , 1994, Ann. Pure Appl. Log..

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

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

[22]  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..

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

[24]  I. Stark,et al.  On the Observable Properties of Higher Order Functions that Dynamically Create Local Names (Preliminary Report) , 1993 .

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