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