Recursive polymorphic types and parametricity in an operational framework

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 82-91

  Melliès, Paul André ^a   Vouillon, Jérôme ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION TECHNIQUES; CALL-B-NAMEΛ-CALCULUS; REALIZABILITY MODELS; RECURSIVE POLYMORPHIC TYPES;

APPROXIMATION THEORY; FORMAL LANGUAGES; MATHEMATICAL MODELS; PARAMETER ESTIMATION;

COMPUTER SCIENCE;

EID: 26844576367     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2005.42     Document Type: Conference Paper

References (27)

1. M. Abadi. top-top-closed relations and admissibility. Mathematical Structures in Computer Science, 10(3):313-320, 2000.
2. M. Abadi, P.-L. Curien, and G. Plotkin. Formal parametric polymorphism. Theoretic Computer Science, 121(1 and 2):9-58, 1993.
3. M. Abadi, B. Pierce, and G. Plotkin. Faithful ideal models for recursive polymorphic types. International Journal of Foundations of Computer Science, 2(1):1-21, Mar. 1991.
4. Summary in Fourth Annual Symposium on Logic in Computer Science, June, 1989.
5. M. Abadi and G. Plotkin. A per model of polymorphism and recursive types. In J. Mitchell, editor, 5th Annual IEEE Symposium on Logic in Computer Science, pages 355-365. IEEE Computer Society Press, 1990.
6. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Clarendon Press, 1994.
7. A. W. Appel and D. McAllester. An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems (TOPLAS), 23(5):657-683, 2001.
8. E. S. Bainbridge, P. J. Freyd, A. Scedrov, and P. J. Scott. Functorial polymorphism. In G. Huet, editor, Logical Foundations of Functional Programming, pages 315-330. Addison-Wesley, Reading, MA, 1990.
9. R. Bellucci, M. Abadi, and P.-L. Curien. A model for formal parametric polymorphism: A per interpretation for system r. In M. Dezani-Ciancaglini and G. Plotkin, editors, Typed Lambda Calculi and Applications: Proc. of the 2nd International Conference on Typed Lambda Calculi and Applications, pages 32-46. Springer, Berlin, Heidelberg, 1995.
10. L. Birkedal and R. Harper. Constructing interpretations of recursives types in an operational setting. Information and Computation, 155:3-63, 1999.
11. K. Bruce and J. C. Mitchell. Per models of subtyping, recursive types and higher-order polymorphism. In 19th Symposium on Principles of programming languages, pages 316-327, New York, NY, USA, 1992. ACM Press.
12. J. Chroboczek. Games semantics and subtyping. PhD thesis and LFCS report ECS-LFCS-03-432, University of Edinburgh, Great Britain, 2003.
13. L. Dami. Labelled reductions, runtime errors and operational subsumption. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, ICALP, volume 1256 of Lecture Notes in Computer Science, pages 782-793. Springer, 1997.
14. L. Dami. Operational subsumption, an ideal model of sub-typing. In A. D. Gordon, A. M. Pitts, and C. Talcott, editors, Second Workshop on Higher-Order Operational Techniques in Semantics, volume 10 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2000.
15. V. Danos and J.-L. Krivine. Disjunctive tautologies and synchronisation schemes. In Computer Science Logic'00, volume 1862 of Lecture Notes in Computer Science, pages 292-301. Springer, 2000.
16. J. Dunfield and F. Pfenning. Type assignment for intersections and unions in call-by-value languages. In Proc. 6th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'03), Lecture Notes in Computer Science. Springer-Verlag, 2003.
17. P. J. Freyd. Algebraically complete categories. In A. Carboni, M. C. Pedicchio, and G. Rosolini, editors, Proceedings of the 1990 Como Category Theory Conference, volume 1488 of Lecture Notes in Mathematics, pages 131-156. Springer-Verlag, 1991.
18. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
19. J.-L. Krivine. Typed lambda-calculus in classical zermelo-fraenkel set theory. Archive of Mathematical Logic, 40(3): 189-205, 2001.
20. J.-J. Lévy. An algebraic interpretation of the lambda beta K-calculus; and an application of a labelled lambda-calculus. Theoretical Computer Science, 2(1):97-114, June 1976.
21. D. MacQueen, G. Plotkin, and R. Sethi. An ideal model for recursive polymorphic types. Information and Control, 71(1-2):95-130, 1986.
22. I. A. Mason, S. F. Smith, and C. L. Talcott. From operational semantics to domain theory. Information and Computation, 128(1):26-47, 1996.
23. M. Parigot Strong normalization for second order classical natural deduction. In 8th Annual IEEE Symposium on Logic in Computer Science, pages 39-46, Montreal, Canada, June 1993. IEEE Computer Society Press.
24. A. M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in computer Science, 10:321-359, 2000.
25. S. F. Smith. The coverage of operational semantics. In A. D. Gordon and A. M. Pitts, editors. Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pages 307-346. Cambridge University Press, 1998.
26. J. Vouillon. Subtyping union types. In J. Marcinkowski and A. Tarlecki, editors, 18th International Workshop CSL 2004, volume 3210 of Lecture Notes in Computer Science, pages 415-429. Springer-Verlag, September 2004.
27. J. Vouillon and P.-A. Melliès. Semantic types: A fresh look at the ideal model for types. In Proceedings of the 31th ACM Conference on Principles of Programming Languages, pages 52-63, Venezia, Italia, Jan. 2004. ACM Press.