by Samson Abramsky, Marina Lenisa
Proceedings of CSL 2000, Springer LNCS Volume 1862
http://www.dimi.uniud.it/~lenisa/Papers/Soft-copy-ps/csl00.ps.gz
Add To MetaCart
Abstract:
Abstract. We present a linear realizability technique for building Partial Equivalence Relations (PER) categories over Linear Combinatory Algebras. These PER categories turn out to be linear categories and to form an adjoint model with their co-Kleisli categories. We show that a special linear combinatory algebra of partial involutions, arising from Geometry of Interaction constructions, gives rise to a fully and faithfully complete model for ML polymorphic types of system F.
Citations
|
126
|
On full abstraction for PCF
– Hyland, Ong
- 2000
|
|
124
|
Full abstraction for PCF
– Abramsky, Jagadeesan, et al.
|
|
101
|
Traced monoidal categories
– Joyal, Street, et al.
- 1996
|
|
100
|
Towards a geometry of interaction
– Girard
- 1989
|
|
69
|
Categories for Types
– Crole
- 1993
|
|
58
|
New foundations for the geometry of interaction
– Abramsky, Jagadeesan
- 1994
|
|
46
|
Full abstraction for functional languages with control
– Laird
- 1997
|
|
44
|
dI-domains as a model of polymorphism
– Breazu-Tannen, Coquand
- 1987
|
|
25
|
Full abstraction for Idealized Algol with passive expressions
– Abramsky, McCusker
- 1999
|
|
15
|
Axioms for full abstraction and full completeness
– Abramsky
- 1996
|
|
12
|
and Full Abstraction for FPC
– Games
- 1996
|
|
9
|
Retracing some paths
– Abramsky
- 1996
|
|
9
|
Realizability models based on history-free strategies
– Abramsky, Longley
- 2000
|
|
9
|
definable functionals and fij-conversion
– Statman
- 1983
|
|
7
|
Categories, Types, and Structures. Foundations of Computing Series
– Asperti, Longo
- 1991
|
|
7
|
Games semantics for untyped - calculus
– Gianantonio, Franco, et al.
- 1999
|
|
6
|
and Full Completeness for Multiplicative Linear Logic
– Games
- 1994
|
|
6
|
Axiomatizing fully complete models for ML polymorphic types
– Abramsky, Lenisa
- 2000
|
|
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
|
|
6
|
Hypergame Semantics: Full Completeness for System F
– Hughes
- 1999
|
|
4
|
Algebraic types
– Hyland, Rosolini
- 1990
|
|
4
|
More Universal Game Models of Untyped - Calculus: The Bohm Tree Strikes Back
– Ker, Ong
- 1999
|
|
3
|
Geometry of Interaction and Models of Combinatory Logic
– Abramsky, Panangaden
- 1998
|
|
3
|
sequential functionals
– Hereditarily
- 1994
|
