Totality in arena games

DOI10.1016/J.APAL.2009.07.016zbMath1225.03029OpenAlexW2115051556MaRDI QIDQ636307

Russ Harmer, Pierre Clairambault

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

zbMATH Keywords

realizabilitygame semantics

Mathematics Subject Classification ID

Applications of game theory (91A80) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Game semantics of Martin-Löf type theory ⋮ A graphical foundation for interleaving in game semantics ⋮ Least and Greatest Fixpoints in Game Semantics ⋮ Dynamic game semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The system \({\mathcal F}\) of variable types, fifteen years later
• On full abstraction for PCF: I, II and III
• Dependent choice, `quote' and the clock
• Polarized games
• Second-order type isomorphisms through game semantics
• Locally cartesian closed categories and type theory
• Abstract Böhm trees
• Games and Definability For FPC
• A semantics of evidence for classical arithmetic
• The Anatomy of Innocence Revisited
• Least and Greatest Fixed Points in Linear Logic

This page was built for publication: Totality in arena games