Monads, ahapely functors and traversals

Electronic Notes in Theoretical Computer Science

Volumn 29, Issue , 1999, Pages 187-208

  Moggi, E ^a   Belle G ^a   Jay, C B ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Functional Monadic Polytypic programming; Shape theory

Indexed keywords

DATA REDUCTION; FUNCTIONS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; STOCHASTIC CONTROL SYSTEMS;

DATA TYPES; FUNCTION/MONADIC/POLYTYPIC PROGRAMMING; SHAPE THEORY; TRAVERSAL;

COMPUTER PROGRAMMING;

EID: 18944377410     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80316-0     Document Type: Conference Paper

References (14)

1. Backhouse R., Jansson P., Jeuring J., Meertens L. Generic programming - an introduction. Lecture notes for the summer school on Advanced Functional Programming. 1998:1999;. In press for LNCS
2. Barr M., Wells C. Toposes, Triples and Theories. 1985;Springer Verlag
3. Cockett J.R.B. List-aritmetic distributive categories: locoi. Journal of Pure and Applied Algebra. 66:1990;1-29
4. Fokkinga M.M. Monadic maps and folds for arbitrary datatypes. Memoranda Informatica. June 1994;University of Twente. 94-28
5. Hoogendijk P., Backhouse R. When do datatypes commute? Moggi E., Rosolini G. CTCS, LNCS. 1290:September 1997;242-260 Springer-Verlag
6. Hoogendijk Paul F. A Generic Theory of Data Types. PhD thesis, Technische Universiteit Eindhoven. 1997
7. Jay C.B. A semantics for shape. Science of Computer Programming. 25:1995;251-283
8. Jones Mark P. A theory of qualified types. ESOP'92, LNCS 582. 1992;Springer Verlag
9. Klop J.W. Combinatory Reduction Systems. PhD thesis, CWI, Amsterdam. 1980
10. Meertens L. Calculate Polytypically! Kuchen and Swierstra. Programming Languages: Implementations, Logics, and Programs, LNCS. 1140:1996;1-16 Springer-Verlag
11. E. Meijer and J. Jeuring. Merging monads and folds for functional programming. In J. Jeuring and E. Meijer, editors, Proceedings of the First International Springschool on Advanced Functional Programming Techniques, LNCS 925, pages 228-266. Springer-Verlag, 1995.
12. Moggi E. Notions of computation and monads. Information and Computation. 93:(1):1991
13. J. Vinárek. Extensions of symmetric hom-functors to the Kleisli category. In Ferenc Gécseg, editor, Proceedings of the 1981 International Conference on Fundamentals of Computation Theory, LNCS 117, pages 394-399, Szeged, Hungary, August 1981. Springer-Verlag.
14. Wadler P. Comprehending monads. Mathematical Structures in Computer Science, 1993. Special issue of selected papers from 6'th Conference on Lisp and Functional Programming. 1992