Totality in arena games
From MaRDI portal
Publication:636307
DOI10.1016/J.APAL.2009.07.016zbMATH Open1225.03029OpenAlexW2115051556MaRDI QIDQ636307FDOQ636307
Authors: Pierre Clairambault, Russ Harmer 
Publication date: 26 August 2011
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2009.07.016
Recommendations
Applications of game theory (91A80) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)
Cites Work
- On full abstraction for PCF: I, II and III
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A semantics of evidence for classical arithmetic
- The system \({\mathcal F}\) of variable types, fifteen years later
- Locally cartesian closed categories and type theory
- Title not available (Why is that?)
- Dependent choice, `quote' and the clock
- Polarized games
- Title not available (Why is that?)
- Abstract Böhm trees
- Title not available (Why is that?)
- The Anatomy of Innocence Revisited
- Title not available (Why is that?)
- Second-order type isomorphisms through game semantics
- Games and Definability For FPC
Cited In (7)
- Least and Greatest Fixpoints in Game Semantics
- Strategy composition in compositional games
- A tale of additives and concurrency in game semantics
- Dynamic game semantics
- Game semantics of Martin-Löf type theory
- Disentangling parallelism and interference in game semantics
- A graphical foundation for interleaving in game semantics
This page was built for publication: Totality in arena games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q636307)
