Hypergames and full completeness for system F (rough draft)

Details Hypergames and full completeness for system F (rough draft) Hypergames and full completeness for system F (rough draft)

2008-01-15

arxiv.org/abs/0801.2575v1

Mathematics

Logic

Notes for the talk "Hypergame semantics: ten years later" given at `Games for Logic and Programming Languages', Seattle, Augus

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hypergames and full completeness for system F (rough draft) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hypergames and full completeness for system F (rough draft), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hypergames and full completeness for system F (rough draft) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-160193