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 coalgebra...
| 主要な著者: | , , |
|---|---|
| フォーマット: | Conference item |
| 出版事項: |
Springer−Verlag
2011
|
Search Result 1
Search Result 2
Search Result 3
Search Result 4
