Hypergames and full completeness for system F (rough draft)
| dc.creator | Hughes, Dominic | |
| dc.date | 2008-01-15 | |
| dc.date.accessioned | 2026-07-07T08:54:56Z | |
| dc.date.available | 2026-07-07T08:54:56Z | |
| dc.description | 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 $\forall 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: ten years later'' given at `Games for Logic and Programming Languages', Seattle, August 2006. | |
| dc.description | Notes for the talk "Hypergame semantics: ten years later" given at `Games for Logic and Programming Languages', Seattle, August 2006. 31 pages, multiple figures | |
| dc.identifier | https://arxiv.org/abs/0801.2575 | |
| dc.identifier | http://arxiv.org/abs/0801.2575 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/146118 | |
| dc.subject | Logic | |
| dc.title | Hypergames and full completeness for system F (rough draft) | |
| dc.type | text |