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: | Arashilar Mazurn |

Country: | Sudan |

Language: | English (Spanish) |

Genre: | Sex |

Published (Last): | 25 January 2007 |

Pages: | 486 |

PDF File Size: | 19.23 Mb |

ePub File Size: | 13.48 Mb |

ISBN: | 753-2-19932-979-4 |

Downloads: | 25870 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Yolar |

Topics Discussed in This Paper.

Causal Commutative Arrows and Their Optimization. In [PT99] this case is called a Freyd-category. Showing of 11 references.

### Generalising monads to arrows – Semantic Scholar

Related theoretical work Here is an incomplete list of theoretical papers dealing with structures similar to arrows. If the monoidal structure on C is given by products, this definition is equivalent to arrows. Papers relating to arrows, divided into generalitiesapplications and related theoretical work. 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. A tutorial introduction to Yampathe latest incarnation of FRP.

Where the arrow functors arr and lift preserve objects, Blute et al introduce mediating morphisms, with dozens of coherence conditions.

## Arrows: A General Interface to Computation

An extension of the previous paper, additionally using static arrows. Decribes the arrowized version of FRP. Citation Statistics Citations 0 20 40 ’98 ’02 ’07 ’12 ‘ The main differences in the final version are: Dynamic optimization for functional reactive programming using generalized algebraic data types Henrik Nilsson ICFP This paper has highly influenced 46 other papers.

An old draft is available online [ pspdf ]. It doesn’t even assume a prior knowledge of monads. An overview of arrows from first principles, with a simplified account of a subset of the arrow notation.

Citations Publications citing this paper.

## There was a problem providing the content you requested

Grammar fragments fly first-class Marcos VieraS. KingPhilip Wadler Functional Programming This paper uses state transformers, which could have been cast as monads, but the arrow formulation greatly simplifies the calculations. The paper introducing “arrows” — a friendly and comprehensive introduction. This leads to geberalising straightforward semantics for Moggi’s computational lambda-calculus.

References Publications referenced by this paper.

Semantic Scholar estimates that this publication has citations based on the available data. A tutorial introduction to arrows and arrow notation.

Arrows may be seen as strict versions of these. Towards safe and efficient functional reactive programming Neil Sculthorpe Showing of extracted citations.

By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License. Report on the Programming Language Haskell: Generalixing list is also available in bibtex format. They also deal with cocontextwhich subsumes ArrowChoice in the same way.

The first mention of the term Freyd-category. See our FAQ for additional information. This paper has citations. Introduces the arrow notation, but will make more sense if you read one of the other papers first. Also in Sigplan Notices.

The Kleisli construction on a strong monad is a special case. They then propose a general model of computation: From This Paper Topics from this paper.