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...

Full description

Bibliographic Details
Main Authors: Hope, Catherine, Hutton, Graham
Format: Conference or Workshop Item
Language:English
Published: 2006
Online Access:http://eprints.nottingham.ac.uk/28194/
http://eprints.nottingham.ac.uk/28194/
http://eprints.nottingham.ac.uk/28194/1/compact.pdf
id nottingham-28194
recordtype eprints
spelling nottingham-281942017-10-12T19:00:03Z http://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 application/pdf en cc_by http://eprints.nottingham.ac.uk/28194/1/compact.pdf Hope, Catherine and Hutton, Graham (2006) Compact fusion. In: Workshop on Mathematically Structured Functional Programming, 2 July 2006, Kuressaare, Estonia. http://ewic.bcs.org/content/ConWebDoc/5350
repository_type Digital Repository
institution_category Local University
institution University of Nottingham Malaysia Campus
building Nottingham Research Data Repository
collection Online Access
language English
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.
format Conference or Workshop Item
author Hope, Catherine
Hutton, Graham
spellingShingle Hope, Catherine
Hutton, Graham
Compact fusion
author_facet Hope, Catherine
Hutton, Graham
author_sort Hope, Catherine
title Compact fusion
title_short Compact fusion
title_full Compact fusion
title_fullStr Compact fusion
title_full_unstemmed Compact fusion
title_sort compact fusion
publishDate 2006
url http://eprints.nottingham.ac.uk/28194/
http://eprints.nottingham.ac.uk/28194/
http://eprints.nottingham.ac.uk/28194/1/compact.pdf
first_indexed 2018-09-06T11:48:14Z
last_indexed 2018-09-06T11:48:14Z
_version_ 1610858621003890688