Sciweavers

32 search results - page 3 / 7
» icfp 2007
Sort
View
ICFP
2007
ACM
14 years 6 months ago
Functional pearl: the great escape or, how to jump the border without getting caught
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...
David Herman
ICFP
2007
ACM
14 years 6 months ago
Call-pattern specialisation for haskell programs
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...
Simon L. Peyton Jones
ICFP
2007
ACM
14 years 6 months ago
Inductive reasoning about effectful data types
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...
Andrzej Filinski, Kristian Støvring
ICFP
2007
ACM
14 years 6 months ago
Lazy call-by-value evaluation
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...
Bernd Braßel, Frank Huch, Germán Vida...
ICFP
2007
ACM
14 years 6 months ago
Stream fusion: from lists to streams to nothing at all
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...
Duncan Coutts, Roman Leshchinskiy, Don Stewart