Notions of computation and monads
Information and Computation
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Full abstraction in the lazy lambda calculus
Information and Computation
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Higher-Order and Symbolic Computation
Secure Information Flow via Linear Continuations
Higher-Order and Symbolic Computation
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of 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
Games Characterizing Levy-Longo Trees
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Game Theoretic Analysis of Call-by-Value Computation
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
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 for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
About Translations of Classical Logic into Polarized Linear Logic
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The Occurrence of Continuation Parameters in CPS Terms
The Occurrence of Continuation Parameters in CPS Terms
A Fully Abstract Game Semantics of Local Exceptions
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
Decidability and syntactic control of interference
Theoretical Computer Science
An equivalence-preserving CPS translation via multi-language semantics
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Decidability in syntactic control of interference
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Remarks on semantic completeness for proof-terms with Laird's dual affine/intuitionistic λ-Calculus
Rewriting Computation and Proof
| Hi-index | 0.01 |
We present a semantic 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 complete model of an affine-type theory--and a syntax-independent and full embedding of a category of Hyland-Ong/Nickau-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 call-by-value PCF, yielding a proof of full abstraction for the associated translation. We discuss extensions of the semantics to deal with recursive types, call-by-name evaluation, nonlocal jumps, and state.