1686 search results - page 40 / 338 » Higher Order Deforestation |
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
ESOP
2009
Springer
15 years 6 months ago
2009
Springer
This paper explores the surprisingly rich design space for the simply typed lambda calculus with casts and a dynamic type. Such a calculus is the target intermediate language of th...
101
click to vote
FOSSACS
2009
Springer
15 years 6 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
VMCAI
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a multi-pass interprocedural analysis and transformation for the functional aggregate update problem. Our solution handles untyped programs, including unrestri...
CALCO
2009
Springer
15 years 6 months ago
2009
Springer
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...