On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Higher-Order and Symbolic Computation
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Designs, Disputes and Strategies
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Syntactic Considerations on Recursive Types
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Full abstraction for functional languages with control
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics of Local Exceptions
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Higher-Order and Symbolic Computation
Remarks on semantic completeness for proof-terms with Laird's dual affine/intuitionistic λ-Calculus
Rewriting Computation and Proof
| Hi-index | 0.00 |
We present an analysis of the "linearly used continuation passing interpretation" of functional languages, based on game semantics. This consists of a category of games with a coherence condition on moves --yielding a fully abstract model of an affine type-theory--and a syntax-independent and full embedding of a category of HO-style "well-bracketed" games into it. We show that this embedding corresponds precisely to linear CPS interpretation in its action on a games model of the call-by-value (untyped) λ-calculus, yielding a proof of full abstraction for the associated translation.