Arrows, like Monads, are Monoids

Electronic Notes in Theoretical Computer Science

Volumn 158, Issue 1, 2006, Pages 219-236

  Heunen, Chris ^a   Jacobs, Bart ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Arrow; Bifunctor; Freyd category; Monad; Monoid

Indexed keywords

FORMAL LANGUAGES; FUNCTIONS; NUMERICAL METHODS; PARAMETER ESTIMATION;

ARROW; BIFUNCTOR; FREYD CATEGORY; MONAD; MONOID;

COMPUTER PROGRAMMING;

EID: 33646158714     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.04.012     Document Type: Article

References (31)

1. Alimarine, A., S. Smetsers, A. van Weelden, M. van Eekelen and R. Plasmeijer, There and back again: arrows for invertible programming, in: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell (2005), pp. 86-97, (ISBN 1-59593-071-X)
2. Bainbridge E., Freyd P., Scedrov A., and Scott P. Functorial polymorphism. Theoretical Computer Science 70 1 (1990) 35-64 corrigendum in
3. Bainbridge E., Freyd P., Scedrov A., and Scott P. Functorial polymorphism. Theor. Comp. Sci. 71 3 (1990) 431
4. Benton N., and Hyland M. Traced premonoidal categories. Theoretical Informatics and Applications 37 (2003) 273-299
5. Borceux F. Handbook of Categorical Algebra. Encyclopedia of Mathematics and its applications 1 (1994), Cambridge University Press
6. Cockett J., Koslowski J., Seely R., and Wood R. Modules. Theory and Applications of Categories 11 (2003) 375-396
7. Courtney, A., "Modeling User Interfaces in a Functional Language," Ph.D. thesis, Yale University (2004)
8. Erkök, L. and J. Launchbury, A recursive do for haskell, in: Haskell Workshop, 2002, pp. 29-37
9. Freyd P. Abelian Categories: An Introduction to the Theory of Functor (1964), Harper and Row, New York
10. Freyd P. Structural polymorphism. Theoretical Computer Science 115 (1993) 107-129
11. Haskell.org. http://www.haskell.org/arrows
12. Hughes J. Generalising monads to arrows. Science of Computer Programming 37 (2000) 67-111
13. Hyland J. A small complete category. Annals of Pure & Applied Logic 40 (1988) 135-165
14. Jacobs B. Categorical Logic and Type Theory (1999), North Holland, Amsterdam
15. Jansson P., and Jeuring J. Polytypic data conversion programs. Science of Computer Programming 43 (2002) 35-75
16. In: Jeuring J., and Jones S.P. (Eds). Arrows, Robots and Functional Reactive Programming. Lect. Notes Comp. Sci. 2638 (2003), Springer
17. Lawvere F. Metric spaces, generalized logic, and closed categories. Seminario Matematico e Fisico. Rendiconti di Milano 43 (1973) 135-166. reprint available via www.tac.mta.ca/tac/reprints
18. Mac Lane S. Categories for the Working Mathematician (1971), Springer
19. Moggi E. Computational lambda-calculus and monads. Logic in Computer Science (1989)
20. Paterson, R., A new notation for arrows, in: International Conference on Functional Programming (2001), pp. 229-240
21. Paterson R. Arrows and computation. In: Gibbons J., and de Moor O. (Eds). The Fun of Programming (2003), Palgrave 201-222. http://www.soi.city.ac.uk/~ross/papers/fop.html
22. Peyton Jones, S. and J. Hughes, Report on the programming language haskell 98, a non-strict purely functional programming language, Technical report, www.haskell.org/onlinereport (1999)
23. Poigne A. Basic category theory. In: Abramsky S., Gabbay D.M., and Maibaum T.S.E. (Eds). Handbook of Logic in Computer Science: Background - Mathematical Structures (Volume 1) (1992), Clarendon Press, Oxford 413-640
24. Power J., and Robinson E. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science 7 (1997)
25. Power J., and Robinson E. Modularity and dyads. Mathematical Foundations of Programming Semantics XV 20 (1999) 467-480
26. Power J., and Thielecke H. Environments, continuation semantics and indexed categories. Theoretical Aspects of Computer Software. Lect. Notes Comp. Sci. number 1281 (1997) 391-414
27. Power J., and Thielecke H. Closed Freyd- and κ-categories. In: Wiedermann J., van Emde Boas P., and Nielsen M. (Eds). International Colloquium on Automata, Languages and Programming. Lect. Notes Comp. Sci. number 1644 (1999) 625-634
28. Swierstra S., and Duponcheel L. Deterministic, error-correcting combinator parsers. In: Launchbury J., Meijer E., and Sheard T. (Eds). Advanced Functional Programming. Lect. Notes Comp. Sci. 1129 (1996) 184-207
29. Uustalu T., and Vene V. Signals and comonads. Journ. of Universal Comp. Sci. 11 7 (2005) 1310-1326
30. Uustalu, T. and V. Vene, The essence of dataflow programming, Revised Lectures from Central European Functional Programming School (Budapest, 2005), to appear, http://www.cs.ioc.ee/~tarmo/papers/
31. Wadler, P., Monads for functional programming, in: Program Design Calculi: Proceedings of the 1992 Marktoberdorf International Summer School (1993)