Conference item icon

Conference item

Theory and Practice of Fusion

Abstract:

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 as a unifying theoretical and notational framework to explore the foundations of these fusion tech­niques. We first introduce the calculational properties of recursive coalgebras and demonstrate th...

Expand abstract

Actions


Authors


Publication date:
2010-08-01
URN:
uuid:6c62d2ab-f267-42bb-88b1-23bc6348d12e
Local pid:
cs:4873

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP