We study extensional models of the untyped lambda calculus in the setting of game semantics. In particular, we show that, somewhat unexpectedly and contrary to what happens in ordinary categories of domains, all reflexive objects in the category of games G, introduced by Abramsky, Jagadeesan and Malacaria, induce the same λ-theory. This is H*, the maximal theory induced already by the classical CPO model D∞, introduced by Scott in 1969. This results indicates that the current notion of game carries a very specic bias towards head reduction.
CITATION STYLE
Gianantonio, P. D., Franco, G., & Honsell, F. (1999). Game semantics for untyped λβηcalculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1581, pp. 114–128). Springer Verlag. https://doi.org/10.1007/3-540-48959-2_10
Mendeley helps you to discover research relevant for your work.