Axiomatizing fully complete models for ML polymorphic types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1893, Issue , 2000, Pages 141-151

  Abramsky, Samson ^a   Lenisa, Marina ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

ADJOINT MODELS; AXIOMATIZATION; AXIOMATIZING; BOHM TREES; INFINITE TREES; KLEISLI CATEGORY; LINEAR CATEGORIES; POLYMORPHIC TYPES;

FORMAL LOGIC;

EID: 23044517849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_10     Document Type: Conference Paper

References (23)

1. S. Abramsky. Axioms for Definability and Full Completeness, in Proof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling and M. Tofte, eds., MIT Press, 2000, 55-75.
2. S. Abramsky, R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, J. of Symbolic Logic 59(2), 1994, 543-574.
3. S. Abramsky, R. Jagadeesan, P. Malacaria. Full Abstraction for PCF, 1996, Inf. and Comp., to appear.
4. A. Asperti, G. Longo. Categories, Types ad Structures, Foundations of Computing Series, The MIT Press, 1991.
5. S. Abramsky, M. Lenisa. Fully Complete Models for ML Polymorphic Types, Report ECS-LFCS-99-414, University of Edinburgh, October 1999.
6. S. Abramsky, G. McCusker. Full abstraction for idealized Algol with passive expressions, TCS 227, 1999, 3-42.
7. S. Abramsky, P. Mellies. Concurrent Games and Full Completeness, LICS'99.
8. V. Breazu-Tannen, T. Coquand. Extensional models for polymorphism, TCS 59, 1988, 85-114.
9. N. Benton, P. Wadler. Linear Logic, Monads and the Lambda Calculus, LICS'96.
10. G. Bierman. What is a categorical Model of Intuitionistic Linear Logic?, TLCA'95 Conf. Proc., LNCS, 1995.
11. R. Crole, Categories for Types, Cambridge University Press, 1993.
12. J.Y. Girard. Interpretation functionelle et elimunation des coupures de l'arithmeti-que d'ordre superieur, These d'Etat, Universite Paris 7, 1972.
13. D.J.D. Hughes. Hypergame Semantics: Full Completeness for System F. D.Phil. thesis, University of Oxford, submitted 1999.
14. J. Hyland, E. Robinson, G. Rosolini. Algebraic types in PER models, MFPS Conf. Proc., M. Main et al. eds, LNCS 442, 1990, 333-350.
15. M. Hyland, L. Ong. On full abstraction for PCF, Inf. and Comp., 1996, to appear.
16. J. Laird. Full abstraction for functional languages with control, LICS'97.
17. F. Lawvere. Equality in hyperdoctrines and the comprehension schema as an adjoint functor, Proc. Symp. on Applications of Categorical Logic, 1970.
18. G. McCusker. Games and full abstraction for FPC, LICS'96.
19. H. Nickau. Hereditarily sequential functionals, Proc. of the Symposium Logical Foundations for Computer Science, LNCS 813, 1994.
20. A. Pitts. Polymorphism is set-theoretic constructively, CTCS'88 Conf. Proc., D.Pitt ed., LNCS 283, 1988.
21. R. Seely. Linear logic, autonomous categories and cofree coalgebras, in Category theory, computer science and logic, American Math. Society, 1987.
22. R. Seely. Polymorphic linear logic and topos models, Math. Reports, Academy of Science (Canada) 12, 1990.
23. Statman. A-definable functionals and conversion, Arch. Math. Logik 23, 1983.