Full abstraction for functional languages with control

This paper considers the consequences of relaxing the bracketing condition on 'dialogue games', showing that this leads to a category of games which can be 'factorized' into a well-bracketed substructure, and a set of classically typed morphisms. These are shown to be sound denotations for control operators, allowing the factorization to be used to extend the definability result for PCF to one for PCF with control operators at atomic types. Thus we define a fully abstract and effectively presentable model of a functional language with non-local control as part of a modular approach to modelling non-functional features using games.

[1]  Chetan R. Murthy.  Extracting Constructive Content From Classical Proofs , 1990 .

[2]  Pierre-Louis Curien.  On the Symmetry of Sequentiality , 1993, MFPS.

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

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

[5]  Matthias Felleisen,et al.  A Syntactic Theory of Sequential Control , 1987, Theor. Comput. Sci..

[6]  D. Prawitz.  Natural Deduction: A Proof-Theoretical Study , 1965 .

[7]  Jean-Jacques Lévy,et al.  Full abstraction for sequential languages : The states of the art , 1983 .

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

[9]  Matthias Felleisen,et al.  Fully Abstract Semantics for Observably Sequential Languages , 1994, Inf. Comput..

[10]  C.-H. Luke Ong,et al.  Pi-calculus, dialogue games and full abstraction PCF , 1995, FPCA '95.

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

[12]  C.-H. Luke Ong,et al.  A Curry-Howard foundation for functional computation with control , 1997, POPL '97.

[13]  Thierry Coquand,et al.  A semantics of evidence for classical arithmetic , 1995, Journal of Symbolic Logic.

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