95 search results - page 1 / 19 » ML Typing, Explicit Polymorphism and Qualified Types |
TACS
1994
Springer
13 years 10 months ago
1994
Springer
The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaran...
POPL
1997
ACM
13 years 10 months ago
1997
ACM
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
PLDI
1989
ACM
13 years 10 months ago
1989
ACM
We present the rst type reconstruction system which combines the implicit typing of ML with the full power of the explicitly typed second-order polymorphic lambda calculus. The sy...
POPL
1997
ACM
13 years 10 months ago
1997
ACM
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
ICFP
1999
ACM
13 years 10 months ago
1999
ACM
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...