Pages that link to "Item:Q1854351"
From MaRDI portal
The following pages link to Games and full abstraction for FPC. (Q1854351):
Displaying 13 items.
- Full abstraction for Reduced ML (Q388212) (← links)
- The category of node-and-choice preforms for extensive-form games (Q1615994) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Game semantics for constructive modal logic (Q2142094) (← links)
- Some Programming Languages Suggested by Game Models (Extended Abstract) (Q2805154) (← links)
- Understanding Game Semantics Through Coherence Spaces (Q3178256) (← links)
- Game Semantics in the Nominal Model (Q3178282) (← links)
- The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms (Q3298274) (← links)
- Realisability semantics of parametric polymorphism, general references and recursive types (Q3583027) (← links)
- Least and Greatest Fixpoints in Game Semantics (Q3617718) (← links)
- Full Abstraction for Reduced ML (Q3617719) (← links)
- Game theoretic analysis of call-by-value computation (Q4571955) (← links)
- An operational domain-theoretic treatment of recursive types (Q5740347) (← links)
