Totality in arena games

Abstract : We tackle the problem of preservation of totality by composition in arena games. We first explain how this problem reduces to a finiteness theorem on what we call pointer structures, similar to the parity pointer functions of Harmer, Hyland and Mélliès and the interaction sequences of Coquand. We discuss how this theorem relates to normalization of linear head reduction in simply-typed lambda-calculus, leading us to a semantic realizability proof à la Kleene of our theorem. We then present another proof of a more combinatorial nature. Finally, we discuss the exact class of strategies to which our theorems apply.
Document type :
Journal articles
Annals of Pure and Applied Logic, Elsevier Masson, 2009, 161 (5), pp.673-689. <10.1016/j.apal.2009.07.016>


https://hal.archives-ouvertes.fr/hal-00443535
Contributor : Pierre Clairambault <>
Submitted on : Wednesday, December 30, 2009 - 12:55:26 PM
Last modification on : Friday, May 11, 2012 - 11:57:41 AM

File

totality.pdf
fileSource_public_author

Identifiers

Collections

Citation

Pierre Clairambault, Russ Harmer. Totality in arena games. Annals of Pure and Applied Logic, Elsevier Masson, 2009, 161 (5), pp.673-689. <10.1016/j.apal.2009.07.016>. <hal-00443535>

Export

Share

Metrics

Consultation de
la notice

92

Téléchargement du document

22