Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads
Information and Computation
Science of Computer Programming - Special issue on mathematics of program construction
A Relational Model of Non-deterministic Dataflow
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Monads for Functional Programming
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
A Theory of Recursive Domains with Applications to Concurrency
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Modelling environments in call-by-value programming languages
Information and Computation
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Call-By-Push-Value: A Functional/Imperative Synthesis (Semantics Structures in Computation, V. 2)
Call-By-Push-Value: A Functional/Imperative Synthesis (Semantics Structures in Computation, V. 2)
Theoretical Computer Science - Logic, semantics and theory of programming
Categorical semantics for arrows
Journal of Functional Programming
Arrows, like Monads, are Monoids
Electronic Notes in Theoretical Computer Science (ENTCS)
The microcosm principle and concurrency in coalgebra
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
What is a Categorical Model of Arrows?
Electronic Notes in Theoretical Computer Science (ENTCS)
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Monads need not be endofunctors
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Freyd categories are Enriched Lawvere Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Hughes' arrows were shown, by Jacobs et al., to be roughly monads in the bicategory Prof of profunctors (distributors, modules). However in their work as well as others', the categorical nature of the first operator was not pursued and its formulation remained rather ad hoc. In this paper, we identify first with strength for a monad, therefore: arrows are strong monads in Prof. Strong monads have been widely used in the semantics of functional programming after Moggi's seminal work, therefore our observation establishes categorical canonicity of the notion of arrow.