Extending ML with semi-explicit higher-order polymorphism
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Typability and type checking in the second-order λ-calculus are equivalent and undecidablePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Objective MLPublished by Association for Computing Machinery (ACM) ,1997
- Putting type annotations to workPublished by Association for Computing Machinery (ACM) ,1996
- Polymorphic type inference and abstract data typesACM Transactions on Programming Languages and Systems, 1994
- A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculusPublished by Association for Computing Machinery (ACM) ,1994
- Programming objects with ML-ART an extension to ML with abstract and record typesPublished by Springer Nature ,1994
- Dynamics in MLPublished by Springer Nature ,1991
- Polymorphic type inference and containmentInformation and Computation, 1988
- Partial polymorphic type inference and higher-order unificationPublished by Association for Computing Machinery (ACM) ,1988
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982