23 search results - page 1 / 5 » From ML to MLF: graphic type constraints with efficient type... |
ICFP
2008
ACM
14 years 4 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
POPL
1993
ACM
13 years 8 months ago
1993
ACM
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
POPL
1998
ACM
13 years 9 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
FOCS
1992
IEEE
13 years 8 months ago
1992
IEEE
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...