Monadic corecursion - Definition, fusion laws, and applications

Electronic Notes in Theoretical Computer Science

Volumn 11, Issue , 1998, Pages 105-139

  Pardo, Alberto ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING; DATA STRUCTURES; MATHEMATICAL MODELS;

FUNCTIONAL PROGRAMMING; MONADIC ANAMORPHISM; MONADIC EFFECT; MONADIC RECURSIVE FUNCTION;

FUNCTIONS;

EID: 19044369783     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00055-6     Document Type: Article

References (29)

1. Bird R., Wadler P. Introduction to Functional Programming. 1988;Prentice-Hall, UK
2. Bird R.S., de Moor O. Relational program derivation and context-free language recognition. A Classical Mind. 1994;17-35 Prentice Hall
3. J. Peterson et. al. Report on the programming language Haskell (version 1.3). Technical Report YALEU/DCS/RR-1107, Yale University, 1996.
4. Maarten M. Fokkinga. Law and Order in Algorithmics. PhD thesis, Universiteit Twente, The Netherlands, 1992.
5. M.M. Fokkinga. Monadic maps and folds for arbitrary datatypes. Memoranda Informatica 94-28, University of Twente, June 1994.
6. P. Freyd. Recursive types reduced to inductive types. In 5th IEEE Symposium on Logic in Computer Science, pages 498-507, 1990.
7. Hu Z., Iwasaki H. Promotional Transformation of Monadic Programs. Fuji International Workshop on Functional and Logic Programming. July 1995;196-210 World Scientific. Also available from http://www.ipl.t.u-tokyo.ac.jp/~hu/
8. J. Jeuring. Theories for Algorithm Calculation. PhD thesis, Utrecht University, 1993.
9. J. Jeuring and Patrik Jansson. Polytypic Programming. In Advanced Functional Programming, LNCS 1129. Springer-Verlag, 1996.
10. Peyton Jones S., Launchbury J. Lazy functional state threads. SIGPLAN PLDI'94. 1994;14-35
11. Lehmann D.J., Smith M.B. Algebraic specification of data types. Mathematical Systems Theory. 14:1981;97-139
12. Malcolm G. Data Structures and Program Transformation. Science of Computer Programming. 14:1990;255-279
13. E.G. Manes and M.A. Arbib. Algebraic Approaches to Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, 1986.
14. Meertens L. Paramorphisms. Formal Aspects of Computing. 4:1992;413-424
15. E. Meijer. More Advice on Proving a Program Correct: Improve a Correct Compiler. Available from http://www.cs.ruu.nl/~erik/.
16. E. Meijer, M. Fokkinga, and R. Paterson. Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. In Proceedings of the ACM FPCA'91, LNCS 523. Springer-Verlag, August 1991.
17. Meijer E., Hutton G. Bananas in space: Extending fold and unfold to exponential types. ACM FPCA '95, SIGPLAN-SIGARCH-WG2.8. 1995;324-333
18. E. Meijer and G. Hutton. Monadic Parser Combinators. Technical Report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham, 1996.
19. Meijer E., Jeuring J. Merging Monads and Folds for Functional Programming. Advanced Functional Programming, LNCS 925. 1995;228-266 Springer-Verlag
20. Moggi E. Notions of Computation and Monads. Information and Computation. 93:1991;55-92
21. P.S. Mulry. Lifting Theorems for Kleisli Categories. In 9th International Conference on Mathematical Foundations of Programming Semantics, LNCS 802, pages 304-319. Springer-Verlag, 1993.
22. Y. Onoue, Z. Hu, H. Iwasaki, and M. Takeichi. A Calculational Fusion System HYLO. In IFIP TC 2 Working Conference on Algorithmic Languages and Calculi, Le Bischenberg, France, pages 76-106. Chapman & Hall, February 1997.
23. A. Pardo. A Calculational Approach to Monadic and Comonadic Programs, forthcoming PhD Thesis. Technische Universität Darmstadt, 1998.
24. S. Peyton-Jones and P. Wadler. Imperative Functional Programming. In Proceedings of 20th Annual ACM Symposium on Principles of Programming Languages, Charlotte, North Carolina, 1993.
25. Schmidt D.A. Denotational Semantics. A Methodology for Language Development. 1986;Allyn and Bacon, Inc, Boston Mass
26. A. Takano and E. Meijer. Shortcut to Deforestation in Calculational Form. In Proceedings of FPCA '95, 1995.
27. D. Tuijnman. A Categorical Approach to Functional Programming. PhD thesis, Fakultät für Informatik, Universität Ulm, Germany, Januar 1996.
28. Wadler P. Comprehending Monads. Mathematical Structures in Computer Science. 2:1992;461-493
29. Wadler P. Monads for functional programming. Advanced Functional Programming. 1995;Springer-Verlag, LNCS 925