An extension of system f with subtyping

Information and Computation

Volumn 109, Issue 1-2, 1994, Pages 4-56

  Cardelli, Luca ^a   Martini, Simone ^b   Mitchell, John C ^c   Scedrov, Andre ^d  

^a HEWLETT PACKARD COMPANY   (United States)

^b UNIVERSITY OF PISA   (Italy)

^c STANFORD UNIVERSITY   (United States)

^d UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003019966     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1994.1013     Document Type: Article

References (29)

1. Abadi, M., Cardelli, L., and Curien, P.-L. (1993), Formal parametric polymorphism, Theoret. Comput. Sci. 121 (1-2), 9-58.
2. Mitchell, J. C., and Scedrov, A. (1993), Notes on sconing and relators, in "Computer Science Logic '92 Selected Papers" (E. Boerger et al., Eds.), Springer- Verlag LNCS 702, pp. 352-378.
3. Böhm, C., and Berarducci, A. (1985), Automatic synthesis of typed λ-programs on term algebras, Theoret. Comput. Sci. 39, 135-154.
4. Bainbridge, E. S., Freyd, P. J., Scedrov, A., and Scott, P. J. (1990), Functorial polymorphism, Theoret. Comput. Sci. 70, No. 1, 35-64.
5. Bruce, K. B., and Longo, G. (1990), A modest model of records, inheritance and bounded quantification, Inform. and Comput. 87, 196-240.
6. Cardelli, L. (1988), A semantics of multiple inheritance. Inform. and Comput. 76, 138-164.
7. Cardelli, L. Extensible records in a pure calculus of subtyping, Digital SRC Report 81, 1993.
8. Cardelli, L., and Longo, G. (1991), A semantic basis for Quest, J. of Fund. Prog. 1, 417-458.
9. Cardelli, L., and Mitchell, J. C. (1991), Operations on records, Math. Struct. Comput. Sci. 1, 3-48.
10. Cardelli, L., and Wegner, P. (1985), On understanding types, data abstraction and polymorphism, Comput. Surveys 17, No. 4, 471-522.
11. Curien, P.-L., and Ghelli, G. (1991), Coherence of subsumption, Math. Structures Comput. Sci., to appear.
12. Curien, P.-L., and Ghelli, G. (1991), Short version in "Proceedings, CAAP 90," Lecture Notes in Computer Science, No. 431, Springer-Verlag, Berlin/New York.
13. Curien, P.-L., and Ghelli, G. (1991), Subtyping + extensionality: Confluence of βл top-reductions in F≤, in "Theoretical Aspects of Computer Software, Sendai, Japan," (T. Ito and A. R. Meyer, Eds.), pp. 731-749, Lecture Notes in Computer Science, No. 526, Springer-Verlag, Berlin/New York.
14. de Bruijn, N. G. (1972), Lambda-calculus notation with nameless dummies, Indag. Math. 34, No. 5, 381-392.
15. Dj Cosmo, R. (to appear), "Second Order Isomorphic Types, a Proof Theoretic Study on Second Order Lambda-Calculus with Surjective Pairing and Terminal Object," Inform. and Comput.
16. Fairbairn, J. (1989), "Some Types with Inclusion Properties in V, p," Technical Report No. 171, University of Cambridge, Computer Laboratory.
17. Freyd, P. J. (1993), Structural polymorphism, Theoret. Comput. Sci. 115, 107-129.
18. Ghelli, G. (1990), "Proof Theoretic Studies about a Minimal Type System Integrating Inclusion and Parametric Polymorphism," Ph.D. Thesis, TD-6/90, Universita di Pisa, Dipartimento di Informatica.
19. Girard, J.-Y. (1971), Une extension de 1'interpretation de Godel a 1'analyse, et son application a I'elimination des coupures dans l'analyse et la theorie des types, in "Proceedings of the Second Scandinavian Logic Symposium" (J. E. Fenstad, Ed.), pp. 63-92, North-Holland, Amsterdam.
20. Lambek, J., and Scott, P. J. (1986), "Introduction to Higher Order Categorical Logic," Cambridge Univ. Press, London/New York.
21. Ma, Q., and Reynolds, J. C. (1992), "Types, Abstraction, and Parametric Polymorphism, Part 2", in Mathematical Foundations of Programming Semantics (S. Brookes et al., Eds.), Proceedings 1991, pp. 1-40, Springer-Verlag LNCS 598.
22. Mitchell, J. C. (1990), A type inference approach to reduction properties and semantics of polymorphic expressions, in "Logical Foundations of Functional Programming" (G. Huet, Ed.), Addison-Wesley, Reading, MA.
23. Mitchell, J. C., and Scott, P. J. (1989), Typed A-models and cartesian closed categories, in "Categories in Computer Science and Logic" (J. W. Gray and A. Scedrov, Eds.), pp. 301-316, Contemporary Mathematics, Vol. 92, Amer. Math. Soc., Providence.
24. Pitts, A. M. (1987), Polymorphism is set-theoretic, constructively, in "Category Theory and Computer Science, Proceedings Edinburgh 1987" (D. H. Pitt, A. Poigne, and D. E. Rydeheard, Eds.), pp. 12-39, Lecture Notes in Computer Science, Vol. 283, Springer-Verlag, Berlin/New York.
25. Reynolds, J. C. (1974), Towards a theory of type structure, in "Colloquium sur la programmation," pp. 408-423, Lecture Notes in Computer Science, No. 19, Springer-Verlag, Berlin/New York.
26. Reynolds, J. C. (1983), Types, abstraction, and parametric polymorphism, in "Information Processing '83" (R. E. A. Mason, Ed.), pp. 513-523, North-Holland, Amsterdam.
27. Scedrov, A. (1990), A guide to polymorphic types, in "Logic and Computer Science" (P. Odifreddi, Ed.), pp. 387-420, Academic Press, San Diego.
28. Strachey, C. (1967), Fundamental concepts in programming languages, lecture notes for the International Summer School in Computer Programming, Copenhagen.
29. Wadler, P. (1989), Theorems for free!, in "Proceedings of the Fourth International Conference on Functional Programming and Computer Architecture," ACM Press.