Compact fusion
There are many advantages to writing functional programs in a compositional style, such as clarity and modularity. However, the intermediate data structures produced may mean that the resulting program is inefficient in terms of space. These may be removed using deforestation techniques, but whether...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2006
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/28194/ |
| _version_ | 1848793522189107200 |
|---|---|
| author | Hope, Catherine Hutton, Graham |
| author_facet | Hope, Catherine Hutton, Graham |
| author_sort | Hope, Catherine |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | There are many advantages to writing functional programs in a compositional style, such as clarity and modularity. However, the intermediate data structures produced may mean that the resulting program is inefficient in terms of space. These may be removed using deforestation techniques, but whether the space performance is actually improved depends upon the structures being consumed in the same order that they are produced. In this paper we explore this problem for the case when the intermediate structure is a list, and present a solution. We then formalise the space behaviour of our solution by means of program transformation techniques and the use of abstract machines. |
| first_indexed | 2025-11-14T19:01:38Z |
| format | Conference or Workshop Item |
| id | nottingham-28194 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:01:38Z |
| publishDate | 2006 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-281942020-05-04T20:29:27Z https://eprints.nottingham.ac.uk/28194/ Compact fusion Hope, Catherine Hutton, Graham There are many advantages to writing functional programs in a compositional style, such as clarity and modularity. However, the intermediate data structures produced may mean that the resulting program is inefficient in terms of space. These may be removed using deforestation techniques, but whether the space performance is actually improved depends upon the structures being consumed in the same order that they are produced. In this paper we explore this problem for the case when the intermediate structure is a list, and present a solution. We then formalise the space behaviour of our solution by means of program transformation techniques and the use of abstract machines. 2006-07 Conference or Workshop Item PeerReviewed Hope, Catherine and Hutton, Graham (2006) Compact fusion. In: Workshop on Mathematically Structured Functional Programming, 2 July 2006, Kuressaare, Estonia. hylomorphism space fold abstract machine http://ewic.bcs.org/content/ConWebDoc/5350 |
| spellingShingle | hylomorphism space fold abstract machine Hope, Catherine Hutton, Graham Compact fusion |
| title | Compact fusion |
| title_full | Compact fusion |
| title_fullStr | Compact fusion |
| title_full_unstemmed | Compact fusion |
| title_short | Compact fusion |
| title_sort | compact fusion |
| topic | hylomorphism space fold abstract machine |
| url | https://eprints.nottingham.ac.uk/28194/ https://eprints.nottingham.ac.uk/28194/ |