Principal Type Schemes for Functional Programs with Overloading and Subtyping

[1]  Carl A. Gunter.  Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.

[2]  Jerzy Tiuryn,et al.  Type Reconstruction with Recursive Types and Atomic Subtyping , 1993, TAPSOFT.

[3]  John C. Mitchell,et al.  Algorithmic aspects of type inference with subtypes , 1992, POPL '92.

[4]  Jerzy Tiuryn.  Subtype inequalities , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

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

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

[7]  Pavel Curtis.  Constrained qualification in polymorphic type analysis , 1990 .

[8]  Mitchell Wand,et al.  On the complexity of type inference with coercion , 1989, FPCA.

[9]  Prateek Mishra,et al.  Polymorphic Subtype Inference: Closing the Theory-Practice Gap , 1989, TAPSOFT, Vol.2.

[10]  Philip Wadler,et al.  How to make ad-hoc polymorphism less ad hoc , 1989, POPL '89.

[11]  Prateek Mishra,et al.  Type Inference with Subtypes , 1990, Theor. Comput. Sci..

[12]  Stefan Kaes,et al.  Parametric Overloading in Polymorphic Programming Languages , 1988, ESOP.

[13]  Ryan Stansifer,et al.  Type inference with subtypes , 1988, POPL '88.

[14]  John C. Reynolds,et al.  Three Approaches to Type Structure , 1985, TAPSOFT, Vol.1.

[15]  John C. Mitchell,et al.  Coercion and type inference , 1984, POPL.

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

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

[18]  Alfred V. Aho,et al.  The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..

[19]  R. Hindley.  The Principal Type-Scheme of an Object in Combinatory Logic , 1969 .