Sciweavers

186 search results - page 2 / 38
» Type Inference for Sublinear Space Functional Programming
Sort
View
POPL
2009
ACM
14 years 6 months ago
Flexible types: robust type inference for first-class polymorphism
We present HML, a type inference system that supports full firstclass polymorphism where few annotations are needed: only function parameters with a polymorphic type need to be an...
Daan Leijen
PPDP
2009
Springer
14 years 5 days ago
Dependent type inference with interpolants
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...
Hiroshi Unno, Naoki Kobayashi
ICFP
2008
ACM
14 years 5 months ago
From ML to MLF: graphic type constraints with efficient type inference
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 ...
Boris Yakobowski, Didier Rémy
POPL
2012
ACM
12 years 1 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
POPL
1991
ACM
13 years 9 months ago
Polymorphic Type Inference and Assignment
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization,...
Xavier Leroy, Pierre Weis