A tutorial on the universality and expressiveness of fold

Journal of Functional Programming

Volumn 9, Issue 4, 1999, Pages 355-372

  Hutton, Graham ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033462272     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003500     Document Type: Article

References (43)

1. Aarts, C., Backhouse, R., Hoogendijk, P., Voermans, E. and van der Woude, J. (1992) A relational theory of datatypes. Available on the World-Wide-Web: http://www.win.tue.nl/win/cs/wp/papers/papers.html.
2. Backhouse, R., Jansson, P., Jeuring, J. and Meertens, L. (1998) Generic programming: An introduction. Lecture Notes of the 3rd International Summer School on Advanced Functional Programming.
3. Backus, J. (1978) Can programming be liberated from the Von Neumann style? A functional style and its algebra of programs. Comm. ACM, 9.
4. Barendregt, H. (1984) The Lambda Calculus - Its syntax and semantics. North-Holland.
5. Bird, R. (1989) Constructive functional programming. Proc. Marktoberdorf International Summer School on Constructive Methods in Computer Science. Springer-Verlag.
6. Bird, R. (1998) Introduction to Functional Programming using Haskell (2nd ed.). Prentice Hall.
7. Bird, R. and de Moor, O. (1997) Algebra of Programming. Prentice Hall.
8. Bird, R. and Meertens, L. (1998) Nested datatypes. In: Jeuring, J. (ed.), Proc. 4th International Conference on Mathematics of Program Construction: Lecture Notes in Computer Science 1422. Springer-Verlag.
9. Bird, R. and Wadler, P. (1988) An Introduction to Functional Programming. Prentice Hall.
10. Cockett, R. and Fukushima, T. (1992) About Charity. Yellow Series Report No. 92/480/18, Department of Computer Science, The University of Calgary.
11. de Moor, O. and Sittampalan, G. (1998) Generic program transformation. Lecture Notes of the 3rd International Summer School on Advanced Functional Programming.
12. Fegaras, L. and Sheard, T. (1996) Revisiting catemorphisms over datatypes with embedded functions. Proc. 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
13. Fokkinga, M. (1994) Monadic maps and folds for arbitrary datatypes. Memoranda Informatica 94-28, University of Twente.
14. Fokkinga, M., Jeuring, J., Meertens, L. and Meijer, E. (1991) Translating attribute grammars into catamorphisms. The Squiggolist, 2(1).
15. Hutton, G. (1998) Fold and unfold for program semantics. Proc. 3rd ACM SIGPLAN International Conference on Functional Programming.
16. Iverson, K. E. (1962) A Programming Language. Wiley.
17. Jansson, P. and Jeuring, J. (1997) PolyP - a polytypic programming language extension. Proc. 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press.
18. Jansson, P. and Jeuring, J. (1998) Polytypic unification. J. Functional Programming (to appear).
19. Jeuring, Jo. (1995) Polytypic pattern matching. Proc. 7th International Conference on Functional Programming and Computer Architecture. ACM Press.
20. Jones, G. (1990) Designing circuits by calculation. Technical Report PRG-TR-10-90, Oxford University.
21. Jones, G. and Sheeran, M. (1990) Circuit design in Ruby. In: Staunstrup (ed.), Formal Methods for VLSI Design. Elsevier.
22. Jones, M. P. and Blampied, P. (1998) A pragmatic approach to maps and folds for parameterized datatypes. Submitted.
23. Kieburtz, R. B. (1998) Reactive functional programming. Proc. PROCOMET. Chapman & Hall.
24. Kieburtz, R. B. and Lewis, J. (1994) Algebraic Design Language (preliminary definition). Oregon Graduate Institute of Science and Technology.
25. Kleene, S. C. (1952) Introduction to Metamathematics. Van Nostrand Rheinhold.
26. Launchbury, J. and Sheard, T. (1995) Warm fusion: Deriving build-catas from recursive definitions. Proc. 7th International Conference on Functional Programming and Computer Architecture. ACM Press.
27. Malcolm, G. (1990a) Algebraic data types and program transformation. PhD thesis, Groningen University.
28. Malcolm, G. (1990b) Algebraic data types and program transformation. Science of Computer Programming, 14(2-3), 255-280.
29. Meertens, L. (1983) Algorithmes: Towards programming as a mathematical activity. Proc. CWI Symposium.
30. Meertens, L. (1992) Paramorphisms. Formal Aspects of Computing, 4(5), 413-425.
31. Meijer, E. (1992) Calculating compilers. PhD thesis, Nijmegen University.
32. Meijer, E. and Hutton, G. (1995a) Bananas in space: Extending fold and unfold to exponential types. Proc. 7th International Conference on Functional Programming and Computer Architecture. ACM Press.
33. Meijer, E. and Jeuring, J. (1995b) Merging monads and folds for functional programming. In: Jeuring, J. and Meijer, E. (eds.), Advanced Functional Programming: Lecture Notes in Computer Science 925. Springer-Verlag.
34. Meijer, E., Fokkinga, M. and Paterson, R. (1991) Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed.), Proc. Conference on Functional Programming and Computer Architecture: Lecture Notes in Computer Science 523. Springer-Verlag.
35. Peterson, J. et al. (1997) The Haskell language report, version 1.4. Available on the World-Wide-Web: http://www.haskell.org.
36. Reynolds, J. C. (1985) Three approaches to type structure. Proc. International Joint Conference on Theory and Practice of Software Development: Lecture Notes in Computer Science 185. Springer-Verlag.
37. Sheard, T. and Fegaras, L. (1993) A fold for all seasons. Proc. ACM Conference on Functional Programming and Computer Architecture. Springer-Verlag.
38. Swierstra, S. D., Alcocer, P. R. A. and Saraiva, J. (1998) Designing and implementing combinator languages. Lecture Notes of the 3rd International Summer School on Advanced Functional Programming.
39. Takano, A. and Meijer, E. (1995) Shortcut deforestation in calculational form. Proc. 7th International Conference on Functional Programming and Computer Architecture. ACM Press.
40. Wadler, P. (1981) Applicative style programming, program transformation, and list operators. Proc. ACM Conference on Functional Programming Languages and Computer Architecture.
41. Wadler, P. (1990) Comprehending monads. Proc. ACM Conference on Lisp and Functional Programming.
42. Wadler, P. (1992a). The essence of functional programming. Proc. Principles of Programming Languages.
43. Wadler, P. (1992b) Monads for functional programming. In: Broy, M. (ed.), Proc. Marktoberdorf Summer School on Program Design Calculi. Springer-Verlag.