Generalising monads to arrows

2000/05/01 by John Hughes · 1 voice · 9 citations
Computer Science · #Logic, programming, and type systems #Model-Driven Software Engineering Techniques #Software Engineering Research

paper · doi:10.1016/s0167-6423(99)00023-4

crossref issued 2000/05/01 · crossref published 2000/05/01 · crossref published-print 2000/05/01 · openalex publication_date 2000/05/01 · crossref created 2002/10/31 · crossref deposited 2024/12/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/24 · crossref indexed 2026/07/16

Cited by

• Exceptionally Monadic Error Handling
• Stream programs are monoid homomorphisms with state
• Retargeting an Abstract Interpreter for a New Language by Partial Evaluation
• The Arrow Calculus as a Quantum Programming Language
• A unified implementation of automata and expression structures, and of the associated algorithms using enriched categories
• Freer Arrows and Why You Need Them in Haskell
• A history of Haskell
• Effects Without Monads: Non-determinism – Back to the Meta Language
• Flexible Dynamic Information Flow Control in the Presence of Exceptions

Discussions

• We argue that Hughes's (2010: doi.org/10.1016/S016... ) notion of Arrows provides a good characterization of the scopal and dynamic properties of expressions that trigger conventional implicatures. [bsky, 0 points, 2 comments]