论文信息 - Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time

Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time

The combination of parameter polymorphism, subtyping extended to qualified and polymorphic types, and polymorphic recursion is useful in standard type inference and gives expressive type-based program analyses, but raises difficult algorithmic problems.

Fritz Henglein | Christian Mossin | Dirk Dussart

[1] Luís Damas. Type assignment in programming languages , 1984 .

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

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

[4] Mikael Rittri,et al. Dimension inference under polymorphic recursion , 1995, FPCA '95.

[5] Fritz Henglein,et al. Type inference and semi-unification , 1988, LISP and Functional Programming.

[6] Mads Tofte,et al. Implementation of the typed call-by-value λ-calculus using a stack of regions , 1994, POPL '94.

[7] Alan Mycroft,et al. Polymorphic Type Schemes and Recursive Definitions , 1984, Symposium on Programming.

[8] Mark P. Jones. A Theory of Qualified Types , 1992, ESOP.

[9] Fritz Henglein,et al. Polymorphic Binding-Time Analysis , 1994, ESOP.

[10] Alexander Aiken,et al. Soft typing with conditional types , 1994, POPL '94.

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

[12] Stefan Kaes. Type inference in the presence of overloading, subtyping and recursive types , 1992, LFP '92.

[13] Robert Paige,et al. Program Derivation by Fixed Point Computation , 1989, Sci. Comput. Program..

[14] Jerzy Tiuryn,et al. The undecidability of the semi-unification problem , 1990, STOC '90.

[15] Flemming Nielson,et al. Automatic Binding Time Analysis for a Typed lambda-Calculus , 1988, Sci. Comput. Program..