We present an axiomatic characterization of models fully-complete for ML-polymorphic types of system F. This axiomatization is given for hyperdoctrine models, which arise as adjoint models, i.e. co-Kleisli categories of suitable linear categories. Examples of adjoint models can be obtained from categories of Partial Equivalence Relations over Linear Combinatory Algebras. We show that a special linear combinatory algebra of partial involutions induces an hyperdoctrine which satisfies our axiomatization, and hence it provides a fully-complete model for ML-types.
|
126
|
On full abstraction for PCF
– Hyland, Ong
- 2000
|
|
124
|
Full abstraction for PCF
– Abramsky, Jagadeesan, et al.
|
|
109
|
A logic for parametric polymorphism
– Plotkin, Abadi
- 1993
|
|
101
|
Traced monoidal categories
– Joyal, Street, et al.
- 1996
|
|
69
|
Categories for Types
– Crole
- 1993
|
|
58
|
New foundations for the geometry of interaction
– Abramsky, Jagadeesan
- 1994
|
|
53
|
Game-theoretic analysis of call-by-value computation
– Honda, V, et al.
- 2000
|
|
46
|
Full abstraction for functional languages with control
– Laird
- 1997
|
|
44
|
dI-domains as a model of polymorphism
– Breazu-Tannen, Coquand
- 1987
|
|
40
|
Call-by-value games
– Abramsky, McCusker
- 1998
|
|
25
|
Full abstraction for Idealized Algol with passive expressions
– Abramsky, McCusker
- 1999
|
|
15
|
Axioms for full abstraction and full completeness
– Abramsky
- 1996
|
|
9
|
Retracing some paths
– Abramsky
- 1996
|
|
9
|
definable functionals and fij-conversion
– Statman
- 1983
|
|
8
|
Linearity, sharing and state
– Abramsky, McCusker
- 1997
|
|
7
|
Games semantics for untyped - calculus
– Gianantonio, Franco, et al.
- 1999
|
|
6
|
and Full Completeness for Multiplicative Linear Logic
– Games
- 1994
|
|
6
|
Interpr'etation functionelle et 'elimunation des coupures de l'arithm`etique d'ordre sup'erieur, Th`ese d'Etat, Universit'e Paris VII
– Girard
- 1972
|
|
5
|
and definability for system F
– Games
- 1997
|
|
4
|
Algebraic types
– Hyland, Rosolini
- 1990
|
|
4
|
More Universal Game Models of Untyped - Calculus: The Bohm Tree Strikes Back
– Ker, Ong
- 1999
|
|
4
|
control and full abstraction
– Games
- 2000
|
|
3
|
Geometry of Interaction and Models of Combinatory Logic
– Abramsky, Panangaden
- 1998
|
|
3
|
sequential functionals
– Hereditarily
- 1994
|
|
3
|
definable functionals and ## conversion
– Statman
- 1983
|
|
2
|
Theory in logical form, Annals of Pure and Applied Logic 51
– Domain
- 1991
|
|
2
|
Realizability models based on hystory-free strategies, Draft paper
– Abramsky
- 1999
|
|
2
|
is a categorical Model of Intuitionistic Linear
– What
- 1995
|
|
2
|
The Genericity Theorem and the Notion of Parametricity
– Longo, Soloviev
- 1992
|
|
1
|
On Full Completeness, Genericity, Parametric Polymorphism
– Abramsky
|
|
1
|
and full abstraction for the lazy lambdacalculus
– Games
- 1995
|
|
1
|
Types ad Structures: An introduction to category theory for the working computer scientist, Foundations of Computing Series
– Categories
- 1991
|
|
1
|
Towards a Geometry of Interaction.Contemporary Mathematics 92
– Girard
- 1989
|
