Fusion of recursive programs with computational effects

Theoretical Computer Science

Volumn 260, Issue 1-2, 2001, Pages 165-207

  Pardo, Alberto ^a  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

Deforestation; Effects; Monads; Program fusion; Recursive operators

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MATHEMATICAL MORPHOLOGY; MATHEMATICAL OPERATORS;

MONADIC HYLOMORPHISMS; RECURSIVE OPERATORS;

RECURSIVE FUNCTIONS;

EID: 0034919685     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00127-4     Document Type: Article

References (39)

1. Domain theory
2. Sorting morphisms
3. Generic programming - An introduction
4. Monadic maps and folds for arbitrary datatypes
5. Recursive types reduced to inductive types
6. The under-appreciated unfold
7. The theory of semi-functors
8. Promotional transformation of monadic programs
9. Fold and unfold for program semantics
10. Towards manipulation of mutually recursive functions
11. A tutorial on (co)algebras and (co)induction
12. Polytypic programming
13. Algebraic specification of data types
14. Data structures and program transformation
15. Algebraic approaches to program semantics
16. More advice on proving a compiler correct: Improve a correct compiler
17. Functional programming with bananas, lenses, envelopes and barbed wire
18. Bananas in space: Extending fold and unfold to exponential types
19. Merging monads and folds for functional programming
20. Notions of computation and monads
21. Lifting theorems for Kleisli categories
22. Simple and efficient purely functional queues and deques
23. A calculational fusion system HYLO
24. Report on the programming language Haskell (version 1.3)
25. Lazy functional state threads
26. Imperative functional programming
27. Shortcut to deforestation in calculational form
28. Deforestation: Transforming programs to eliminate trees
29. Comprehending mondas
30. Monads for functional programming