Anzeige
Erschienen in:
2003 | OriginalPaper | Buchkapitel
A Game Semantics of Linearly Used Continuations
verfasst von : James Laird
Erschienen in: Foundations of Software Science and Computation Structures
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We present an analysis of the “linearly used continuationpassing 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 “wellbracketed” 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.