12 search results - page 1 / 3 » Positive supercompilation for a higher order call-by-value l... |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
POPL
2009
ACM
14 years 5 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
One of the applications of supercompilation is proving properties
of programs.We focus in this paper on a speci c task: proving term
equivalence for a higher-order lazy functiona...
IFL
2007
Springer
13 years 11 months ago
2007
Springer
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
FCT
2009
Springer
13 years 8 months ago
2009
Springer
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...