Request PDF on ResearchGate | Generalising monads to arrows | Monads have become very popular for structuring functional programs since. Semantic Scholar extracted view of “Generalising monads to arrows” by John Hughes. CiteSeerX – Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): this paper. Pleasingly, the arrow interface turned out to be applicable to other.

Author: Zulkirn Mikami
Country: Botswana
Language: English (Spanish)
Genre: Literature
Published (Last): 25 March 2012
Pages: 473
PDF File Size: 17.89 Mb
ePub File Size: 10.91 Mb
ISBN: 577-3-47675-928-7
Downloads: 90558
Price: Free* [*Free Regsitration Required]
Uploader: Shaktigore

Papers relating to arrows, divided into generalitiesapplications and related theoretical work.

The list is also available in bibtex format. The paper introducing “arrows” — a friendly and comprehensive introduction. It doesn’t even assume a prior knowledge of monads.

An old draft is available online [ pspdf ]. The main differences in the final version are: Introduces the arrow notation, but will make more sense if you read one of the other papers first. An overview of arrows from first principles, with a simplified account of a subset of the arrow notation.


A tutorial introduction to arrows and arrow notation.

A tutorial introduction to Yampathe latest incarnation of FRP. This paper uses state transformers, which could have been cast as monads, but the arrow formulation greatly simplifies the calculations. An extension of the previous paper, additionally using static arrows.

Arrows: bibliography

Causal Commutative Arrows and Their Optimization. Decribes the arrowized version of FRP. Related theoretical work Here is an incomplete list of theoretical papers dealing with structures similar to arrows. Arrows may be seen as strict versions of these. Where the arrow functors arr and lift preserve objects, Blute et al introduce mediating morphisms, with dozens of coherence conditions.

They also deal with cocontextwhich subsumes ArrowChoice in the same way. They then propose a general model of computation: The Kleisli construction on a strong monad is a special case.

If the monoidal structure on C monass given by products, this definition is equivalent to arrows. In [PT99] this case is called a Freyd-category.


Generalising monads to arrows

Implicit in Power and Robinson’s definition is a notion of morphism between these structures, which is stronger and less satisfactory than that used by Hughes.

This leads to an straightforward semantics for Moggi’s computational lambda-calculus. The first mention of the term Freyd-category.