Theory and Practice of Fusion
There are a number of approaches for eliminating intermediate data structures in functional programs—this elimination is commonly known as fusion. Existing fusion strategies are built upon various, but related, recursion schemes, such as folds and unfolds. We use the concept of recursive coalgebras...
| Автори: | , , |
|---|---|
| Формат: | Report |
| Опубліковано: |
Department of Computer Science‚ University of Oxford
2011
|