Implementing collection classes with monads

Mathematical Structures in Computer Science

Volumn 8, Issue 3, 1998, Pages 231-276

  Manes, Ernie G ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85016709730     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129598002515     Document Type: Article

References (26)

1. Barr, M. and Wells, C. (1985) Toposes, Triples, and Theories, Springer-Verlag.
2. Beck, J. (1967) Distributive laws. Springer-Verlag Lecture Notes in Mathematics 80 119–140.
3. Birkhoff, G. (1935) On the structure of abstract algebras. Proc. Camb. Phil. Soc. 31 433–454.
4. Bloom, S. and Esik, Z. (1993) Iteration Theories, the Equational Logic of Iterative Processes, Springer-Yerlag.
5. Buneman, P., Naqvi, S., Tannen, V., and Wong, L. (1995) Principles of programming with complex objects and collection types. Theoretical Computer Science 149 3–48.
6. Eilenberg, S. and Moore, J. C. (1965) Adjoint functors and triples. Illinois J. Math. 9 381–398.
7. Eilenberg, S. (1974) Automata, Languages, and Machines, Vol. A, Academic Press.
8. Filinski, A. (1994) Representing monads, Proceedings of POPL '94 Symposium on Principles of Programming Languages, ACM Press 446–457.
9. Godement, R. (1958) Theorie des Faisceux, Hermann.
10. Goodman, I. R. and Nguyen, H. T. (1985) Uncertainty Models for Knowledge-Based Systems, North-Holland.
11. Barry Jay, C. (1995) A semantics for shape. Science of Computer Programming 25 251–283.
12. Kleisli, H. (1965) Every standard construction is induced by a pair of adjoint functors. Proc. Amer. Math. Soc. 16 544–546.
13. Kock, A. (1970) Monads on symmetric monoidal closed categories. Arch. Math. 21.
14. Kock, A. (1971) Bilinearity of cartesian closed monads. Math. Scand. 29 161–174.
15. Lawvere, F. W. (1963) Functorial Semantics of Algebraic Theories, dissertation, Columbia University.
16. Mac Lane, S. (1971) Categories for the Working Mathematician, Springer-Verlag.
17. Manes, E. G. (1976) Algebraic Theories, Springer-Verlag.
18. Manes, E. G. (1982) A class of fuzzy theories. J. Math. Anal. Appl. 85 409–451.
19. Manes, E. G. (1992) Predicate Transformer Semantics, Cambridge University Press.
20. Moggi E. (1991) Notions of computation and monads. Information and Computation 93 55–92.
21. Moggi, E. (1995) A semantics for evaluation logic. Fund Informaticae 22 117–152.
22. Peyton Jones, S. L. (ed.) (1987) The Implementation of Functional Programming Languages, Prentice-Hall.
23. Steele, G. L. (1994) Building interpreters by composing monads, Proceedings of POPL '94 Symposium on Principles of Programming Languages, ACM Press, 472–492.
24. Taylor, W. (1979) Equational Logic. Houston J. Math. 5.
25. Trinder, P. (1991) Comprehensions, a query notation for DBPLs. In: Kanellakis P. and Schmidt, J. W. (eds) Database Programming Languages: Bulk Types and Persistent Data, Third International Workshop, Aug. 27–30, 1991, Nafplion. Greece, Morgan-Kaufmann Publishers, San Mateo, CA, USA 55–68.
26. Wadler, P. (1992) Comprehending monads. Math. Struct, in Comp. Sci. 2 461–493.