Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Science of Computer Programming - Special issue on mathematics of program construction
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Environments, Continuation Semantics and Indexed Categories
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Deterministic, Error-Correcting Combinator Parsers
Advanced Functional Programming, Second International School-Tutorial Text
Modelling environments in call-by-value programming languages
Information and Computation
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
There and back again: arrows for invertible programming
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
Distributive laws for the coinductive solution of recursive equations
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Structuring quantum effects: superoperators as arrows
Mathematical Structures in Computer Science
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
Coalgebraic components in a many-sorted microcosm
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Categorifying Computations into Components via Arrows as Profunctors
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
Traces for coalgebraic components
Mathematical Structures in Computer Science
Monads need not be endofunctors
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
The sequential semantics of producer effect systems
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Freyd categories are Enriched Lawvere Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Arrows are an extension of the well-established notion of a monad in functional-programming languages. This paper presents several examples and constructions and develops denotational semantics of arrows as monoids in categories of bifunctors Cop × C → C. Observing similarities to monads – which are monoids in categories of endofunctors C → C – it then considers Eilenberg–Moore and Kleisli constructions for arrows. The latter yields Freyd categories, mathematically formulating the folklore claim ‘Arrows are Freyd categories.’