168 search results - page 5 / 34 » A Generalization of Hybrid Let-Polymorphic Type Inference Al... |
DLS
2008
13 years 9 months ago
2008
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
SCP
2010
13 years 5 months ago
2010
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
JFP
2008
13 years 6 months ago
2008
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
PPDP
2009
Springer
14 years 2 months ago
2009
Springer
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
HMF is a conservative extension of Hindley-Milner type inference with first-class polymorphism. In contrast to other proposals, HML uses regular System F types and has a simple ty...