Worker/wrapper/makes it/faster

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.

Full text not available from this repository.

Abstract

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.

Item Type: Conference or Workshop Item (Paper)
RIS ID: https://nottingham-repository.worktribe.com/output/998635
Additional Information: Published in: ICFP '14: proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming. New York : ACM, 2014, ISBN: 978-1-4503-2873-9. pp. 95-107, doi: 10.1145/2628136.2628142
Keywords: general recursion; improvement
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Hutton, Prof Graham
Date Deposited: 18 Mar 2015 18:35
Last Modified: 04 May 2020 20:16
URI: https://eprints.nottingham.ac.uk/id/eprint/28181

Actions (Archive Staff Only)

Edit View Edit View