439 search results - page 26 / 88 » Type invariants for Haskell |
ICFP
1999
ACM
14 years 1 days ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson†Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
OOPSLA
2005
Springer
14 years 1 months ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
ICFP
1999
ACM
14 years 1 days ago
1999
ACM
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
TBILLC
2005
Springer
14 years 1 months ago
2005
Springer
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deï...
FLOPS
2010
Springer
14 years 25 days ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...