Worker/wrapper/makes it/faster
Much research in program optimization has focused on formal approaches to correctness: proving that the meaning of programs is preserved by the optimisation. Paradoxically, there has been comparatively little work on formal approaches to efficiency: proving that the performance of optimized programs...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2014
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/28181/ |
| _version_ | 1848793520569057280 |
|---|---|
| author | Hackett, Jennifer Hutton, Graham |
| author_facet | Hackett, Jennifer Hutton, Graham |
| author_sort | Hackett, Jennifer |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | Much research in program optimization has focused on formal approaches to correctness: proving that the meaning of programs is preserved by the optimisation. Paradoxically, there has been comparatively little work on formal approaches to efficiency: proving that the performance of optimized programs is actually improved. This paper addresses this problem for a general-purpose optimization technique, the worker/wrapper transformation. In particular, we use the call-by-need variant of improvement theory to establish conditions under which the worker/wrapper transformation is formally guaranteed to preserve or improve the time performance of programs in lazy languages such as Haskell. |
| first_indexed | 2025-11-14T19:01:36Z |
| format | Conference or Workshop Item |
| id | nottingham-28181 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:01:36Z |
| publishDate | 2014 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-281812020-05-04T20:16:43Z https://eprints.nottingham.ac.uk/28181/ Worker/wrapper/makes it/faster Hackett, Jennifer Hutton, Graham Much research in program optimization has focused on formal approaches to correctness: proving that the meaning of programs is preserved by the optimisation. Paradoxically, there has been comparatively little work on formal approaches to efficiency: proving that the performance of optimized programs is actually improved. This paper addresses this problem for a general-purpose optimization technique, the worker/wrapper transformation. In particular, we use the call-by-need variant of improvement theory to establish conditions under which the worker/wrapper transformation is formally guaranteed to preserve or improve the time performance of programs in lazy languages such as Haskell. 2014 Conference or Workshop Item PeerReviewed Hackett, Jennifer and Hutton, Graham (2014) Worker/wrapper/makes it/faster. In: ACM SIGPLAN International Conference on Functional Programming (19th), 1-3 Sept 2014, Gothenburg, Sweden. general recursion; improvement http://dl.acm.org/citation.cfm?doid=2628136.2628142 |
| spellingShingle | general recursion; improvement Hackett, Jennifer Hutton, Graham Worker/wrapper/makes it/faster |
| title | Worker/wrapper/makes it/faster |
| title_full | Worker/wrapper/makes it/faster |
| title_fullStr | Worker/wrapper/makes it/faster |
| title_full_unstemmed | Worker/wrapper/makes it/faster |
| title_short | Worker/wrapper/makes it/faster |
| title_sort | worker/wrapper/makes it/faster |
| topic | general recursion; improvement |
| url | https://eprints.nottingham.ac.uk/28181/ https://eprints.nottingham.ac.uk/28181/ |