On the complexity of ML typability with overloading
- 1 January 1991
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Deciding ML typability is complete for deterministic exponential timePublished by Association for Computing Machinery (ACM) ,1990
- How to make ad-hoc polymorphism less ad hocPublished by Association for Computing Machinery (ACM) ,1989
- The essence of MLPublished by Association for Computing Machinery (ACM) ,1988
- An overview of MirandaACM SIGPLAN Notices, 1986
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978