Journal article icon

Journal article

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 techniques. We first introduce the calculational properties of recursive coalgebras and demonstrate the...

Expand abstract

Actions


Access Document


Publisher copy:
10.1007/978-3-642-24276-2_2

Authors


Journal:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume:
6647 LNCS
Pages:
19-37
Publication date:
2011-01-01
DOI:
EISSN:
1611-3349
ISSN:
0302-9743
URN:
uuid:366af9ad-6482-4917-8bf3-5b0d883b7c89
Source identifiers:
328770
Local pid:
pubs:328770
Language:
English

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