Categorical semantics for arrows

Journal of Functional Programming

Volumn 19, Issue 3-4, 2009, Pages 403-438

  Jacobs, Bart ^a   Heunen, Chris ^a   Hasuo, Ichiro ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CATEGORICAL SEMANTICS; DENOTATIONAL SEMANTICS; EILENBERG-MOORE AND KLEISLI CONSTRUCTION; ENDOFUNCTORS; MONOIDS;

FUNCTIONAL PROGRAMMING;

SEMANTICS;

EID: 67749129555     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796809007308     Document Type: Article

References (31)

1. Alimarine, A., Smetsers, S., van Weelden, A., van Eekelen, M. & Plasmeijer, R. (2005) There and back again: arrows for invertible programming. In Proceedings of the 2005 ACM SIGPLAN Workshop on Haskell, Haskell '05 (Tallinn, September 2005). ACM Press, pp. 86-97.
2. Bénabou, J. (2000) Distributors at work. Lecture notes written by Thomas Streicher. http://www.mathematik.tu-darmstadt.de/∼streicher/FIBR/ Diwo.pdf.gz (Accessed 4 May 2009).
3. Benton, N. & Hyland, M. (2003) Traced premonoidal categories, Theoret. Inform. Appl., 37 (4): 273-299.
4. Borceux, F. (1994a) Handbook of Categorical Algebra, Volume 1: Basic Category Theory, Encyclopedia of Mathematics and Its Applications, vol. 50. Cambridge University Press.
5. Borceux, F. (1994b) Handbook of Categorical Algebra, Volume 2: Categories and Structures, Encyclopedia of Mathematics and Its Applications, vol. 51. Cambridge University Press.
6. Cattani, G. L. & Winskel, G. (2005) Profunctors, open maps and bisimulation, Math. Struct. Comput. Sci., 15 (3): 553-614.
7. Day, B. J. (1970) Closed categories of functors. In Reports of the Midwest Category Seminar, Dold, A. & Eckmann, B. (eds), Lecture Notes in Mathematics, vol. 137. Springer, pp. 1-38.
8. Erkök, L. & Launchbury, J. (2002) A recursive do for Haskell. In Proceedings of the 2002 ACM SIGPLAN Workshop on Haskell, Haskell '02 (Pittsburgh, PA, October 2002). ACM Press, pp. 29-37.
9. Freyd, P. J. (1964) Abelian Categories: An Introduction to the Theory of Functors. Harper and Row.
10. Heunen, C. & Jacobs, B. (2006) Arrows, like monads, are monoids. In Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, MFPS-XXII (Genova, May 2006), Brookes, S. & Mislove, M. (eds), Electronic Notes in Theoretical Computer Science, vol. 158. Elsevier, pp. 219-236.
11. Hughes, J. (2000) Generalising monads to arrows, Sci. Comput. Program., 37 (1-3): 67-111.
12. Hughes, J. (2005) Programming with arrows. In Revised Lectures from 5th International School on Advanced Functional Programming, AFP 2004 (Tartu, August 2004), Vene, V. & Uustalu, T. (eds), Lecture Notes in Computer Science, vol. 3622. Springer, pp. 73-129.
13. Hyland, J. M. E. (1988) A small complete category, Ann. Pure Appl. Logic, 40 (2): 135-165.
14. Jacobs, B. (1999) Categorical Logic and Type Theory, Studies in Logic and the Foundations of Mathematics, vol. 141. North-Holland.
15. Jacobs, B. (2006) Distributive laws for the coinductive solution of recursive equations. Inform. Comput., 204 (4): 561-587.
16. Jacobs, B. & Hasuo, I. (2006) Freyd is Kleisli, for arrows. In Proceedings of the Workshop on Mathematically Structured Functional Programming, MSFP 2006 (Kuressaare, July 2006), McBride, C. & Uustalu, T. (eds), Electronic Workshops in Computing. BCS, article 9.
17. Kelly, G. M. (1982) Basic Concepts of Enriched Category Theory. London Mathematical Society Lecture Notes Series, vol. 64. Cambridge University Press.
18. Levy, P. B., Power, J. & Thielecke, H. (2003) Modelling environments in call-by-value programming languages, Inform. Comput., 185 (2): 182-210.
19. Li, P. & Zdancewic, S. (2008) Arrows for Secure Information Flow, Technical Report MS-CIS-08-02. School of Computer and Information Sciences, University of Pennsylvania.
20. Mac Lane, S. (1971) Categories for the Working Mathematician, Graduate Texts in Mathematics, vol. 5. Springer.
21. Moggi, E. (1989) Computational lambda-calculus and monads. In Proceedings of the 4th Annual IEEE Symposium on Logic in Computer Science, LICS '89 (Pacific Grove, CA, June 1989). IEEE CS Press, pp. 14-23.
22. Paterson, R. (2001) A new notation for arrows. In Proceedings of the 6th ACM SIGPLAN International Conference on Functional Programming, ICFP '01 (Florence, September 2001). ACM Press, pp. 229-240.
23. Paterson, R. (2003) Arrows and computation. In The Fun of Programming, Gibbons, J. & de Moor, O. (eds), Cornerstones of Computing. Palgrave MacMillan, pp. 201-222.
24. Peyton Jones, S. L. (ed.) (2003) Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press.
25. Power, J. & Thielecke, H. (1997) Environments, continuation semantics and indexed categories. In Proceedings of the 3rd International Symposium on Theoretical Aspects of Computer Software. TACS '97 (Sendai, September 1997), Abadi, M. & Ito, T. (eds), Lecture Notes in Computer Science, vol. 1281. Springer, pp. 391-414.
26. Robinson, E. P. & Power, J. (1997) Premonoidal categories and notions of computation, Math. Struct. Comput. Sci., 7 (5): 453-468.
27. Street, R. (1972) The formal theory of monads, J. Pure Appl. Algebra, 2: 149-169.
28. Swierstra, S. D. & Duponcheel, L. (1996) Deterministic, error-correcting combinator parsers. In Tutorial Text from Second International School on Advanced Functional Programming (Olympia, WA, August 1996), Launchbury, J., Meijer, E. & Sheard, T. (eds), Lecture Notes in Computer Science, vol. 1129. Springer, pp. 184-207.
29. Uustalu, T. & Vene, V. (2005) Signals and comonads, J. Univ. Comput. Sci., 11 (7): 1310-1326.
30. Vizzotto, J. K., Altenkirch, T. & Sabry, A. (2006) Structuring quantum effects: superoperators as arrows, Math. Struct. Comput. Sci., 16 (3): 453-468.
31. Wadler, P. (1993) Monads for functional programming. In Proceedings of the NATO ASI on Program Design Calculi (Marktoberdorf, July/August 1992), Broy, M. (ed.), NATO ASI Series F, vol. 118. Springer, pp. 233-264.