32 search results - page 3 / 7 » icfp 2007 |
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
Filinski showed that callcc and a single mutable reference cell are sufficient to express the delimited control operators shift and reset. However, this implementation interacts p...
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
105
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing of lazy computations. We present a new approach in...
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
This paper presents an automatic deforestation system, stream fusion, based on equational transformations, that fuses a wider range of functions than existing short-cut fusion sys...