The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Hypergames and full completeness for system F (rough draft)
[article]
2008
arXiv
pre-print
This paper reviews the fully complete hypergames model of system F, presented a decade ago in the author's thesis. Instantiating type variables is modelled by allowing "games as moves". The uniformity of a quantified type variable ∀ X is modelled by copycat expansion: X represents an unknown game, a kind of black box, so all the player can do is copy moves between a positive occurrence and a negative occurrence of X. This presentation is based on slides for a talk entitled "Hypergame semantics:
arXiv:0801.2575v1
fatcat:guswll2hkfcrngz3bmuakx3v2i