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.
|Published (Last):||22 October 2014|
|PDF File Size:||6.64 Mb|
|ePub File Size:||13.12 Mb|
|Price:||Free* [*Free Regsitration Required]|
Citation Statistics Citations 0 20 40 ’98 ’02 ’07 ’12 ‘ Arrows may be seen as strict versions of these.
Implicit monzds Power and Robinson’s definition is a notion of morphism between these structures, which is stronger and less satisfactory than that used by Hughes. If the monoidal structure on C is given by products, this definition is equivalent to arrows. From This Paper Topics from this paper.
The paper introducing “arrows” — a friendly and comprehensive introduction.
An extension of the previous arrowss, additionally using static arrows. Where the arrow functors arr and lift preserve objects, Blute et al introduce mediating morphisms, with dozens of coherence conditions.
The list is also available in bibtex format. Introduces the arrow notation, but will make more sense if you read one of the other papers first.
Also in Sigplan Notices. The main differences in the final version are: An overview of arrows from first principles, with a simplified account of a subset of the arrow notation. Showing of 11 references. This paper has highly influenced 46 other papers. It doesn’t even assume a prior knowledge of monads.
They then propose a general model of computation: A tutorial introduction to arrows and arrow notation. This paper uses state transformers, which could have been cast as monads, but the arrow formulation greatly simplifies the calculations. Topics Discussed in This Paper. Report on the Programming Language Haskell: Dynamic optimization for functional reactive programming using generalized generzlising data types Henrik Nilsson ICFP See our FAQ for additional information.
CiteSeerX — Generalising Monads to Arrows
Showing of extracted citations. Causal Commutative Arrows and Their Optimization. Citations Publications citing this paper. Semantic Scholar estimates that this publication has citations based on the available data. Grammar fragments fly first-class Marcos VieraS. The Kleisli construction on a strong monad is a special case. Related theoretical work Here is an incomplete list of theoretical papers dealing with structures similar to arrows.
An old draft is available online [ pspdf ].
A tutorial introduction to Yampathe latest incarnation of FRP. Combining Monads David J. Decribes the arrowized version of FRP. Towards safe and efficient functional reactive programming Neil Sculthorpe In [PT99] this case is called a Freyd-category.
There was a problem providing the content you requested
They also deal with cocontextwhich subsumes ArrowChoice in the same way. References Publications referenced by this paper. The first mention of the term Freyd-category.
This paper has citations. This leads to an straightforward semantics for Moggi’s computational lambda-calculus.