论文信息 - Lower Bounds on Type Checking Overloading

Lower Bounds on Type Checking Overloading

Smith has proposed an elegant extension of the ML type system for polymorphic functional languages with overloading. Type inference in his system requires solving a satisfiability problem that is undecidable if no restrictions are imposed on overloading. We explore the effect of recursion and the structure of type assumptions in overloadings on the problem's complexity.

Dennis M. Volpano

[1] Robin Milner,et al. Principal type-schemes for functional programs , 1982, POPL '82.

[2] John Doner,et al. Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[3] Geoffrey Smith. Polymorphic Type Inference for Languages with Overloading and Subtyping , 1991 .

[4] Tobias Nipkow,et al. Type checking type classes , 1993, POPL '93.

[5] Geoffrey Smith,et al. Principal Type Schemes for Functional Programs with Overloading and Subtyping , 1994, Sci. Comput. Program..

[6] Simon L. Peyton Jones,et al. Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[7] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[8] Geoffrey Smith,et al. On the Complexity of ML Typability with Overloading , 1991, FPCA.

[9] Helmut Seidl,et al. Haskell Overloading is DEXPTIME-Complete , 1994, Inf. Process. Lett..

[10] Dexter Kozen,et al. Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[11] Geoffrey Smith. Polymorphic Type Inference with Overloading and Subtyping , 1993, TAPSOFT.