When is a function a fold or an unfold?

Electronic Notes in Theoretical Computer Science

Volumn 44, Issue 1, 2001, Pages 146-160

  Gibbons, Jeremy ^a   Hutton, Graham ^b   Altenkirch, Thorsten ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; DATA REDUCTION; DATA STRUCTURES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROGRAM COMPILERS; SET THEORY; TREES (MATHEMATICS);

COALGEBRA; DATATYPE; RECURSION OPERATORS; SET-THEORETIC FUNCTIONS;

RECURSIVE FUNCTIONS;

EID: 0011699068     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80906-X     Document Type: Conference Paper

References (24)

1. Bird R., de Moor O. Algebra of Programming. 1997;Prentice Hall
2. K. Claessen and J. Hughes. Quickcheck: A lightweight tool for random testing of Haskell programs. In Proc. 5th ACM SIGPLAN International Conference on Functional Programming, September 2000.
3. Cole M. Parallel programming with list homomorphisms. Parallel Processing Letters. 5:(2):1995;191-203
4. J. Gibbons. Calculating functional programs. In Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, Oxford, April 2000.
5. J. Gibbons and G. Hutton. Proof methods for structured corecursive programs. In Proc. 1st Scottish Functional Programming Workshop, Stirling, Scotland, August 1999.
6. J. Gibbons and G. Jones. The under-appreciated unfold. In Proc. 3rd ACM SIGPLAN International Conference on Functional Programming, Baltimore, Maryland, September 1998.
7. M. M. Fokkinga. Law and Order in Algorithmics. PhD thesis, Universiteit Twente, 1992.
8. Gorlatch S. Extracting and implementing list homomorphisms in parallel program development. Science of Computer Programming. 33:1999;1-27
9. Z. Hu, H. Iwasaki and M. Takeichi. Deriving structural hylomorphisms from recursive definitions. In Proc. 1st ACM SIGPLAN International Conference on Functional Programming, 1996.
10. G. Hutton. Fold and unfold for program semantics. In Proc. 3rd ACM SIGPLAN International Conference on Functional Programming, Baltimore, Maryland, September 1998.
11. Hutton G. A tutorial on the universality and expressiveness of fold. Journal of Functional Programming. 9:(4):July 1999;355-372
12. B. Jacobs. Exercises in coalgebraic specification. In Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, Oxford, April 2000.
13. Jacobs B., Moss L., Reichel H., Rutten J. Proc. of the First Workshop on Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science Volume 11:1998;Elsevier Science B.V
14. Jacobs B., Rutten J. A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science. 62:1997;222-259
15. Jacobs B., Rutten J. Proc. of the Second Workshop on Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science Volume 19:1999;Elsevier Science B.V
16. J. Launchbury and T. Sheard. Warm fusion: Deriving build-catas from recursive definitions. In Proc. Conference on Functional Programming Languages and Computer Architecture, ACM Press, 1995.
17. S. Mac Lane. Categories for the Working Mathematician. Number 5 in Graduate Texts in Mathematics. Springer-Verlag, 1971.
18. Malcolm G. Algebraic data types and program transformation. Science of Computer Programming. 14:(2-3):September 1990;255-280
19. Meertens L. Paramorphisms. Formal Aspects of Computing. 4:(5):1992;413-424
20. E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In J. Hughes, editor, Proc. Conference on Functional Programming and Computer Architecture, number 523 in LNCS. Springer-Verlag, 1991.
21. A. Takano and E. Meijer. Shortcut deforestation in calculational form. In Proc. Conference on Functional Programming Languages and Computer Architecture, ACM Press, 1995.
22. V. Vene and T. Uustalu. Functional programming with apomorphisms (corecursion). Proceedings of the Estonian Academy of Sciences: Physics, Mathematics, 47(3):147-161, 1998.
23. V. Vene. Categorical Programming with Inductive and Coinductive Types. PhD thesis, Universitity of Tartu, 2000.
24. Wadler P. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science. 73:1990;231-248