102 search results - page 1 / 21 » Practical type inference for arbitrary-rank types |
SAC
2011
ACM
12 years 7 months ago
2011
ACM
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
SCP
2010
13 years 3 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
2007
13 years 4 months ago
2007
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
JFP
2008
13 years 3 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...
ICFP
1997
ACM
13 years 9 months ago
1997
ACM
We present a type system for the programming language Erlang. The type system supports subtyping and declarationfree recursive types, using subtyping constraints. Our system is si...