[Main website]


Fusion and deforestation allows to specify small transformation pass from different data structures, and then the intermediate data structures are not built. An example is list filtering and then sum.

In CL it is solved partially using a powerful loop macro, and writing ad-hoc code. But it is less composable than in Haskell.

Links to this note