The worker/wrapper transformation

Journal of Functional Programming

Volumn 19, Issue 2, 2009, Pages 227-251

  Gill, Andy ^a   Hutton, Graham ^b  

^a UNIVERSITY OF KANSAS   (United States)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPILER WRITERS; EQUATIONAL REASONING; FUNCTIONAL PROGRAMMING COMMUNITY;

FUNCTIONAL PROGRAMMING;

EID: 68149162280     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796809007175     Document Type: Article

References (34)

1. Ager, Mads Sig, Biernacki, Dariusz, Danvy, Olivier & Midtgaard, Jan (2003) A functional correspondence between evaluators and abstract machines. In Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Uppsala, Sweden.
2. Altenkirch, Thorsten (2001) Representations of first-order function types as terminal coalgebras. In Typed Lambda Calculi and Applications. LNCS, no. 2044. Berlin: Springer.
3. Backhouse, Roland (2002) Galois connections and fixed point calculus. In Algebraic and Coalgebraic Methods in the Mathematics of Program Construction LNCS Tutorial, vol. 2297. Berlin: Springer-Verlag.
4. Backhouse, Roland, Bijsterveld, Marcel, van Geldrop, Rik & van der Woude, Jaap (1995) Categorical fixed point calculus. In Proceedings of the Sixth International Conference on Category Theory and Computer Science. Berlin: Springer-Verlag.
5. Bird, Richard (1998) Introduction to Functional Programming using Haskell, second edition. New York: Prentice Hall.
6. Burstall, Rod & Darlington, John (1977) A transformational system for developing recursive programs. J. ACM 24, 44-67.
7. Chitil, Olaf (2000a) Type-Inference Based Deforestation of Functional Programs. Ph.D. thesis, RWTH Aachen.
8. Chitil, Olaf (2000b) Type-inference based short cut deforestation (nearly) without inlining. In Proceedings of 11th International Workshop on Implementation of Functional Languages, Chris Clack and Pieter Koopman (eds). LNCS, no. 1868. Berlin: Springer.
9. Coutts, Duncan, Leshchinskiy, Roman & Stewart, Don (2007) Stream fusion: From lists to streams to nothing at all. In Proceedings of the 2007 ACM SIGPLAN International Conference on Functional Programming. New York: ACM Press.
10. Gamma, Erich, Helm, Richard, Johnson, Ralph & Vlissides, John (1995) Design Patterns. Reading, Mass: Addison-Wesley Professional.
11. Gibbons, Jeremy & Jones, Geraint (1998). The under-appreciated unfold. In Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming Baltimore, Maryland.
12. Gill, Andy (1996) Cheap Deforestation for Non-Strict Functional Languages. Ph.D. thesis, University of Glasgow.
13. Gill, Andy (2006) Introducing the haskell equational reasoning assistant. In Proceedings of the 2006 ACM SIGPLAN Workshop on Haskell. New York: ACM Press.
14. Gill, Andy, Launchbury, John & Peyton Jones, Simon (1993) A short cut to deforestation. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture. New York: ACM Press.
15. Hinze, Ralf (2008) Functional pearl: Streams and unique fixed points. In Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming Victoria, British Columbia.
16. Hoare, Tony (1972) Proof of correctness of data representations. Acta Informatica 1(4), 271-281.
17. Hughes, John (1986) A novel representation of lists and its application to the function reverse. Info. Process. Lett. 223), pp 141-144.
18. Hutton, Graham (1999) A tutorial on the universality and expressiveness of fold. J. Funct. Prog. 9(4), pp 355-372.
19. Hutton, Graham (2007) Programming in Haskell, Cambridge: Cambridge University Press.
20. Hutton, Graham & Wright, Joel (2004) Compiling exceptions correctly. In Proceedings of the Seventh International Conference on Mathematics of Program Construction. LNCS, vol. 3125. Stirling, Scotland: Springer.
21. Hutton, Graham & Wright, Joel (2006) Calculating an exceptional machine. Selected papers from the Fifth Symposium on Trends in Functional Programming, Munich, vol. 5, November 2004 UK: Intellect.
22. Hutton, Graham & Wright, Joel (2007) What is the meaning of these constant interruptions? J. Funct. Prog. 17(6), pp 777-792.
23. Launchbury, John & Sheard, Tim (1995) Warm fusion: Deriving build-catas from recursive definitions. In Proceedings of the Seventh ACM SIGPLAN/SIGARCH International Conference on Functional Programming Languages and Computer Architecture. New York: ACM Press.
24. McBride, Conor & Paterson, Ross (2008) Applicative programming with effects. J. Funct. Prog. 18(1), pp 1-13.
25. Meijer, Erik, Fokkinga, Maarten & Paterson, Ross (1991) Functional programming with bananas, lenses, envelopes and barbed wire. In Proceedings of the Conference on Functional Programming and Computer Architecture, Hughes, John (ed). LNCS, no. 523. Springer-Verlag.
26. Michie, Donald (1968) Memo functions and machine learning. Nature, 218, pp 19-22.
27. Peyton Jones, Simon (2003) Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press. Also available on www.haskell.org/definition.
28. Peyton Jones, Simon & Launchbury, John (1991) Unboxed values as first class citizens in a non-strict functional language. In Proceedings of the Conference on Functional Programming and Computer Architecture. Cambridge, MA: Springer-Verlag.
29. Peyton Jones, Simon & Partain, Will (1993) Measuring the effectiveness of a simple strictness analyser. In Proceedings of the 1993 Glasgow Workshop on Functional Programming, Hammond, Kevin & O'Donnell, John (eds). Ayr, Scotland: Springer-Verlag.
30. Peyton Jones, Simon, Tolmach, Andrew & Hoare, Tony (2001) Playing by the rules: Rewriting as a practical optimisation technique in GHC. In Proceedings of the 2001 ACM SIGPLAN Workshop on Haskell. ACM Press.
31. Reynolds, John C. (1972) Definitional interpreters for higher-order programming languages. In Proceedings of the ACM Annual Conference. ACM Press.
32. Sands, David (1998) Improvement theory and its applications. In Higher Order Operational Techniques in Semantics, Gordon, Andrew & Pitts, Andrew (eds). Cambridge, UK: Cambridge University Press.
33. Santos, Andre (1995) Compilation by Transformation in Non-strict Functional Languages. Ph.D. thesis, University of Glasgow.
34. Schmidt, David (1986) Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, Inc.