Totality in arena games - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Pure and Applied Logic Année : 2009

Totality in arena games

Résumé

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.
Fichier principal
Vignette du fichier
totality.pdf (315.66 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00443535 , version 1 (30-12-2009)

Identifiants

Citer

Pierre Clairambault, Russ Harmer. Totality in arena games. Annals of Pure and Applied Logic, 2009, 161 (5), pp.673-689. ⟨10.1016/j.apal.2009.07.016⟩. ⟨hal-00443535⟩
159 Consultations
148 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More