Games and full abstraction for FPC.
From MaRDI portal
Publication:1854351
DOI10.1006/inco.1999.2845zbMath1046.68508OpenAlexW2650831125MaRDI QIDQ1854351
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c391b1ac7792fb73fe65d00860a0b2455dc7e039
Game theory (91A99) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Higher-type and set recursion theory (03D65)
Related Items
The category of node-and-choice preforms for extensive-form games, Game semantics for constructive modal logic, Understanding Game Semantics Through Coherence Spaces, Game Semantics in the Nominal Model, Game theoretic analysis of call-by-value computation, Full abstraction for Reduced ML, Game-theoretic analysis of call-by-value computation, The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms, An operational domain-theoretic treatment of recursive types, Realisability semantics of parametric polymorphism, general references and recursive types, Least and Greatest Fixpoints in Game Semantics, Full Abstraction for Reduced ML, Some Programming Languages Suggested by Game Models (Extended Abstract)
Cites Work
- Linear logic
- I-categories as a framework for solving domain equations
- LCF considered as a programming language
- Fully abstract models of typed \(\lambda\)-calculi
- Fully abstract semantics for observably sequential languages
- On full abstraction for PCF: I, II and III
- Kripke logical relations and PCF
- Relational properties of domains
- The Category-Theoretic Solution of Recursive Domain Equations
- Games and full completeness for multiplicative linear logic
- Games and Definability For FPC
- Axiomatic Domain Theory in Categories of Partial Maps
- Game theoretic analysis of call-by-value computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item