Skip to main content

Research Repository

See what's under the surface

Advanced Search

The under-performing unfold: a new approach to optimising corecursive programs

Hackett, Jennifer; Hutton, Graham; Jaskelioff, Mauro

Authors

Jennifer Hackett

Mauro Jaskelioff



Abstract

This paper presents a new approach to optimising corecursive programs by factorisation. In particular, we focus on programs written using the corecursion operator unfold. We use and expand upon the proof techniques of guarded coinduction and unfold fusion, capturing a pattern of generalising coinductive hypotheses by means of abstraction and representation functions. The pattern we observe is simple, has not been observed before, and is widely applicable. We develop a general program factorisation theorem from this pattern, demonstrating its utility with a range of practical examples.

Publication Date Jan 1, 2013
Peer Reviewed Peer Reviewed
APA6 Citation Hackett, J., Hutton, G., & Jaskelioff, M. (2013). The under-performing unfold: a new approach to optimising corecursive programs
Keywords fusion, factorisation, coinduction, unfolds
Publisher URL http://dl.acm.org/citation.cfm?doid=2620678.2620679
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf
Additional Information Published in: IFL '13: proceedings of the 25th Symposium on Implementation and Application of Functional Languages. New York : ACM, 2014, ISBN: 978-1-4503-2988-0. pp. 4321-4332, doi: 10.1145/2620678.2620679

Files

underperforming.pdf (250 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations

;