A sequent calculus for subtyping polymorphic types

Information and Computation

Volumn 164, Issue 2, 2001, Pages 345-369

  Tiuryn, Jerzy ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; SEMANTICS;

CALCULUS;

FORMAL LOGIC;

EID: 0035966853     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2941     Document Type: Conference Paper

References (21)

1. Bainbridge, E. S., Freyd, P. J., Scedrov, A., and Scott, P. J. (1989). Functorial polymorphism. Theoret. Comput. Sci. 70, 35-64. [Corrigendum:, Theoret. Comput. Sci 71. 431. Preliminary report in "Logical Foundations of Functional Programming" (G. Huet. Ed.). Addison Wesley. Reading, MA. 1990.]
2. Barendregt, H. P. (1984). "The Lambda Calculus. Its Syntax and Semantics." second ed., North-Holland, Amsterdam.
3. Bruce, K., and Longo, G. (1990). A modest model of records, inheritance and bounded quantification. Inform. and Comput. 87. 196-240.
4. Bruce, K. and Mitchell, J. C. (1992), PER models of subtyping, recursive types and higher-order polymorphism. in "Proc. 19th ACM Symp. on Principles of Programming Languages." pp. 316-327.
5. Cardelli, L., and Longo, G. (1990), "A Semantic Basis for Quest." Technical Report. 55. DEC Systems Research Center. [To appear in J. Funct. Program.]
6. Cardelli, L., Martini, S., Mitchell, J., and Seedrov. A. (1994). An extension of System F with subtyping. Inform. and Comput. 109. 4 56. [Preliminary version appeared. in "Proc. Theor. Aspects of Computer Software," Lecture Notes in Computer Sciences. Vol. 526, pp. 750-770 Springer-Verlag. Berlin New York. 1991.]
7. Cardelli, L., and Wegner, P. (1985), On understanding types, data abstraction, and polymorphism. Comput. Surveys 17, 471-522.
8. ≤. Math. Struct. Comput. Sci. 2, 55-91.
9. Gabbay, D. M. (1974). On 2nd order intuitionistic propositional Calculus with full comprehension. Arch. Math. Logik. 16, 177-186.
10. Girard, J.-Y. (1971). Une extension de l'interpretation de Gödel à l'analyse, et son application à l'elimination des coupures dans l'analyse et la théorie des types, in "2nd Scandinavian Logic Symposium" (J. F. Fenstad, Ed.) pp. 63-92. North-Holland, Amsterdam.
11. Girard, J.-Y. (1972). "Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur," Thèse de Doctorat d'Etat. Université Paris VII.
12. Girard, J.-Y. (1993). On the unity of logic. Ann. Pure Appl. Logic 59, 201-217.
13. Löb, M. H. (1976). Embedding first order predicate logic in fragments of intuitionistic logic, J. Symbolic Logic 41, 705-718.
14. Longo, G., Milsted. K., and Soloviev. S. (1995), A logic of subtyping, in "Proc. IEEE Symp. on Logic in Computer Science," pp. 292-299.
15. Mitchell, J. C. (1988) Polymorphic type inference and containment, Inform. and Comput. 76. 211-249. [Reprinted in "Logical Foundations of Functional Programming" (G. Huet. Ed.) pp. 153-194, Addison Wesley, Reading, MA.]
16. Reynolds, J. C. (1974), Towards a theory of type structure, in "Paris Colloq. on Programming," Lecture Notes in Computer Science. Vol. 19, pp. 408-425. Springer-Verlag. Berlin.
17. Tiuryn, J. (1995), Equational axiomatization of bicoercibility for polymorphic types, in "Proc. 15th Conference Foundations of Software Technology and Theoretical Computer Science" (P. S. Thiagarajan. Ed.). Lecture Notes in Computer Science. Vol. 1026, pp. 166-179. Springer-Verlag. Berlin New York.
18. Tiuryn, J., and Urzxczyn, P. (1996), The subtyping problem for second-order types is undecidable. "Proc. IEEE Symp. on Logic in Computer Science." pp. 74-85. [To appear in Inform. and Comput.]
19. Troelstra, A. S., and van Dalen, D. (1988), "Constructivism in Mathematics. An Introduction." Vol. 1. North-Holland. Amsterdam.
20. Wells, J. (1994). Typability and type checking in the second-order λ-calculus are equivalent and undecidable, in "Proc. 9th Ann. IEEE Symp. Logic in Comput. Sci.." pp. 176-185.
21. Wells, J. (1995). "The Undecidability of Mitchell's Subtyping Relation." Technical report, Computer Sci. Dept., Boston University.