On the complexity of type inference with coercion

Authors:
Mitchell Wand;Patrick O'Keefe
Affiliations:
College of Computer Science, Northeastern University, 360 Huntington Avenue, 161CN, Boston, MA;ICAD, Inc., 1000 Massachusetts Avenue, Cambridge, MA
Venue:
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Year:
1989

ML with extended pattern matching and subtypes

LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Polymorphic unification and ML typing

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with subtypes

Proceedings of the Second European Symposium on Programming
A simple applicative language: mini-ML

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Coercion and type inference

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Unify and conquer

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Algorithmic aspects of type inference with subtypes

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lower bounds on type inference with subtypes

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extending hindley-milner type inference with coercive structural subtyping

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Survey: Colouring, constraint satisfaction, and complexity

Computer Science Review
Satisfiability of Inequalities in a Poset

Fundamenta Informaticae

Hi-index	0.00