Game semantics and linear CPS interpretation
From MaRDI portal
Publication:1770417
DOI10.1016/J.TCS.2004.10.022zbMath1070.68085OpenAlexW1991950204MaRDI QIDQ1770417
Publication date: 6 April 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.022
Related Items (4)
Weighted models for higher-order computation ⋮ Completeness of second-order intuitionistic propositional logic with respect to phase semantics for proof-terms ⋮ Decidability and syntactic control of interference ⋮ StkTokens: Enforcing well-bracketed control flow and stack encapsulation using linear capabilities
Cites Work
- Notions of computation and monads
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Full abstraction in the lazy lambda calculus
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Linear continuation-passing
- Secure information flow via linear continuations
- Polarized games
- Relational properties of domains
- Game-theoretic analysis of call-by-value computation
- Control categories and duality: on the categorical semantics of the lambda-mu calculus
- Classical logic, continuation semantics and abstract machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Game semantics and linear CPS interpretation