The genericity theorem and parametricity in the polymorphic &lgr;-calculus
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
An extension of system F with subtyping
Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
Polymorphism is Set Theoretic, Constructively
Category Theory and Computer Science
Games and Definability for System F
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
Least and Greatest Fixpoints in Game Semantics
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Game semantics for call-by-value polymorphism
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Game Semantics for a Polymorphic Programming Language
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
This article presents a game semantics for higher-rank polymorphism, leading to a new model of the calculus System F, and a programming language which extends it with mutable variables. In contrast to previous game models of polymorphism, it is quite concrete, extending existing categories of games by a simple development of the notion of question/answer labelling and the associated bracketing condition to represent “copycat links” between positive and negative occurrences of type variables. Some well-known System F encodings of type constructors correspond in our model to simple constructions on games, such as the lifted sum. We characterize the generic types of our model (those for which instantiation reflects denotational equivalence), and show how to construct an interpretation in which all types are generic. We show how mutable variables (à la Scheme) may be interpreted in our model, allowing the definition of polymorphic objects with local state. By proving definability of finitary elements in this model using a decomposition argument, we establish a full abstraction result.