Abstract
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 for optimising compilers. We report practical experiments using novel variants of supercompilation, with special attention to let bindings and the generalisation technique.
| Original language | English |
|---|---|
| Pages | 147-164 |
| Number of pages | 18 |
| Publication status | Published - 2008 |