The subtyping problem for second-order types is undecidable

Information and Computation

Volumn 179, Issue 1, 2002, Pages 1-18

  Tiuryn, Jerzy ^a   Urzyczyn, Pawel ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER SIMULATION; FORMAL LANGUAGES; SEMANTICS; THEOREM PROVING;

POLYMORPHIC LAMBDA CALCULUS; POLYMORPHIC LANGUAGES; SECOND ORDER TYPES; STACK REGISTER MACHINES; SUBTYPING PROBLEM; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY;

EID: 0037175746     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.2950     Document Type: Article

References (12)

1. Barendregt, H. P. (1984), "The Lambda Calculus: Its Syntax and Semantics," North-Holland, Amsterdam.
2. Chrzaszcz, J. (1998), Polymorphic subtyping without distibutivity, in "Proc. Mathematical Foundations of Computer Science" (L. Brim, J. Gruska, and J. Zlatuska, Eds.), Lecture Notes in Computer Science, Vol. 1450, pp. 346-355, Springer-Verlag, Berlin.
3. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages and Computation," Addison-Wesley, Reading, MA.
4. Jim, T. (1995), System F plus subsumption reduces to Mitchell’s subtyping relation, manuscript.
5. Longo, G., Milsted, K., and Soloviev, S. (1995), A logic of subtyping, in"Proc. 10th IEEE Symp. Logic in Computer Science, San Diego," pp. 292-299.
6. Mitchell, J. C. (1988), Polymorphic type inference and containment. Inform. and Comput. 76, 211-249.
7. Odersky, M., and Läufer, K. (1995), Putting type annotations to work, presented at the Newton Institute Workshop Advances in Type Systems for Computing, August 1995.
8. Pierce, B. C. (1994), Bounded quantification is undecidable, Inform. and Comput. 112, 131-165.
9. Tiuryn, J. (1995), Equational axiomatization of bicoercibility for polymorphic types, in "Proc. Conf. Foundations of Software Technology and Teoretical Computer Science '95" (P. S. Thiagarajan, Ed.), Lecture Notes in Computer Science, Vol. 1026, pp. 166-179, Springer-Verlag, Berlin.
10. Wells, J. B. (1999), Typability and type checking in the second-order λ-calculus are equivalent and undecidable, Ann. Pure Appl. Logic 98, 111-156, (Preliminary version in "Proc. 9th IEEE Symposium on Logic in Computer Science, Paris, France, 1994," pp. 176-185.)
11. Wells, J. B. (1995), "The Undecidability of Mitchell’s Subtyping Relationship," Technical Report 95-019, Computer Science Department, Boston University.
12. Wells, J. B. (1996), "Typability is Undecidable for F+Eta," Technical Report 96-022, Computer Science Department, Boston Univesity.