Difference between revisions of "Arrow"
EndreyMark (talk  contribs) (→Introducton: and →Examples: : most important introductory materials and examples: arrow parser, mimicking dataflow programming) 
Tomjaguarpaw (talk  contribs) (Remove outdated information about upgrading to GHC 6.10) 

(66 intermediate revisions by 13 users not shown)  
Line 1:  Line 1:  
+  {{Standard classArrowmodule=Control.Arrowmoduledoc=ControlArrowpackage=base}} 

+  
__TOC__ 
__TOC__ 

−  == 
+  == Overview == 
−  [http://www.haskell.org/arrows/index.html Arrows: A General Interface to Computation] written by [http://www.soi.city.ac.uk/%7Eross/ Ross Peterson]. 

+  Arrows, or Freydcategories, are a generalization of Monads. 

−  HaWiki's [http://www.haskell.org/tmrwiki/ArrowsIntroduction ArrowsIntroduction] 

+  "They can do everything monads can do, and more. They are roughly comparable to monads with a static component." However "Arrows do have some problems". ''(need a more useful comparison)'' 

+  
+  For an introduction, see [[#External links]]. 

+  
+  == Library == 

+  
+  * [http://www.haskell.org/ghc/docs/latest/html/libraries/base/ControlArrow.html Control.Arrow] is the standard library for arrows. 

+  * [http://www.haskell.org/arrows/download.html Arrow transformer library] (see the bottom of the page) is an extension with arrow transformers, subclasses, useful data types (Data.Stream, Data.Sequence). 

+  * [http://hackage.haskell.org/package/arrows arrows package] 

== Examples == 
== Examples == 

+  
+  Various concepts follow here, which can be seen as concrete examples covered by the arrow concept. Not all of them provide links to Haskellrelated materials: some of them are here only to give a selfcontained material (e.g. section [[#Automaton]] gives links only to the finite state concept itself.). 

+  
+  === Practice === 

+  
+  Reasons, when it may be worth of solving a specific problem with arrows (instead of [[monad]]s) can be read in 

+  [http://caml.inria.fr/pub/mlarchives/camllist/2000/08/3c42f0fad3b3ecaca4f6043af65f6315.en.html a message from Daan Leijen]. 

+  But Leijen's post is rather old (2000). Arrows are now significantly easier to understand and use than they were back then. Eg, his example might be rewritten 

+  test = proc _ > do 

+  question < ask < "what is the question ?" 

+  answer < ask < question 

+  returnA < ("the answer to '" ++ question ++ "' is " ++ answer) 

+  (or something vaguely like that). 

+  
+  === Function === 

+  
+  Arrow operations <hask>arr</hask> and <hask>>>></hask> are rather straightforward. For implementing <hask>first</hask> and related concepts, see [[Prelude extensions#Tuples]]. 

=== Parser === 
=== Parser === 

−  +  The reasons why the arrow concept can solve important questions when designing a parser library are explained in [http://www.haskell.org/arrows/biblio.html Generalising Monads to Arrows] written by [http://www.cse.chalmers.se/~rjmh/ John Hughes]. 

−  An implementation: [http://www.cs.helsinki.fi/u/ekarttun/PArrows/ PArrows] written by [http://www.haskell.org/tmrwiki/EinarKarttunen Einar Karttunen]. 

+  A good example of the mentioned arrow parsers can be seen in [http://www.soi.city.ac.uk/~ross/papers/notation.html A New Notation for Arrows] written by [http://www.soi.city.ac.uk/%7Eross/ Ross Paterson]: figure 2, 4, 6 (page 3, 5, 6): 

+  :<math>\mathrm{expr} ::= \mathrm{term}\;\mathrm{exprTail}</math> 

+  :<math>\mathrm{exprTail} ::= \mathbf{PLUS}\;\mathrm{term}\;\mathrm{exprTail}\;\vert\;\mathbf{MINUS}\;\mathrm{term}\;\mathrm{exprTail}\;\vert\;\epsilon</math> 

+  is represented with arrow parsers this way: 

+  <haskell> 

+  data Expr = Plus Expr Expr  Minus Expr Expr  ... 

+  
+  expr :: ParseArrow () Expr 

+  expr = proc () > do 

+  t < term < () 

+  exprTail < t 

+  
+  exprTail :: ParseArrow Expr Expr 

+  exprTail = proc e > do 

+  symbol PLUS < () 

+  t < term < () 

+  exprTail < Plus e t 

+  <+> do 

+  symbol MINUS < () 

+  t < term < () 

+  exprTail < Minus e t 

+  <+> returnA < e 

+  </haskell> 

+  
+  An arrow parser library: [http://hackage.haskell.org/package/PArrows PArrows] written by Einar Karttunen. 

+  
+  Another arrow parser implementation: [http://anttijuhani.kaijanaho.fi/tmp/LLParser.hs LLParser.hs] written by [http://anttijuhani.kaijanaho.fi/newblog/ AnttiJuhani Kaijanaho] (I read the [http://www.scannedinavian.com/~shae/blog/20060314.html reference] to it in [http://www.scannedinavian.com/~shae/blog/index.html Shae Erisson's blog / journal]). 

+  
+  The funny thing which took a long time for me to understand arrow parsers is a sort of differential approach  in contrast to the [http://www.willamette.edu/~fruehr/haskell/seuss.html wellknown parser approaches]. (I mean, in some way wellknown parsers are of differential approach too, in the sense that they manage state transitions where the states are remainder streams  but here I mean being differential in another sense: arrow parsers seem to me differential in the way how they consume and produce values  their input and output.) 

+  
+  The idea of borrowing this image from mathematical analysis comes from another topic: the version control systems article [http://sourcefrog.net/weblog/software/vc/derivatives.html Integrals and derivatives] written by Martin Pool uses a similar image. 

+  
+  [http://www.soi.city.ac.uk/~ross/papers/fop.html Arrows and Computation] written by [http://www.soi.city.ac.uk/%7Eross/ Ross Paterson] (pages 2, 6, 7) and [http://www.carlssonia.org/ogi/ProdArrows/ ProdArrows  Arrows for Fudgets] 

+  written by [http://www.carlssonia.org/ Magnus Carlsson] (page 9) mentions that computation (e.g. state) is threaded through the operands of <hask>&&&</hask> operation. 

+  I mean, even the mere definition of <hask>&&&</hask> operation 

+  <haskell> 

+  p &&& q = arr dup >>> first p >>> second q 

+  </haskell> 

+  shows that the order of the computation (the side effects) is important when using <hask>&&&</hask>, and this can be exemplified very well with parser arrows. See an example found in [http://hackage.haskell.org/package/PArrows PArrows] written by Einar Karttunen (see module <hask>Text.ParserCombinators.PArrow.Combinator</hask>): 

+  <haskell> 

+    Match zero or more occurrences of the given parser. 

+  many :: MD i o > MD i [o] 

+  many = MStar 

+  
+    Match one or more occurrences of the given parser. 

+  many1 :: MD i o > MD i [o] 

+  many1 x = (x &&& MStar x) >>> pure (\(b,bs) > (b:bs)) 

+  </haskell> 

+  The definition of <hask>between</hask> parser combinator can show another example for the importance of the order in which the computation (e.g. the side effects) take place using <hask>&&&</hask> operation: 

+  <haskell> 

+  between :: MD i t > MD t close > MD t o > MD i o 

+  between open close real = open >>> (real &&& close) >>^ fst 

+  </haskell> 

+  A more complicated example (from the same module): 

+  <haskell> 

+    Match one or more occurrences of the given parser separated by the separator. 

+  sepBy1 :: MD i o > MD i o' > MD i [o] 

+  sepBy1 p s = (many (p &&& s >>^ fst) &&& p) >>^ (\(bs,b) > bs++[b]) 

+  </haskell> 

+  This makes clear that the order of effects of the operands of <hask>&&&</hask> operation can be important. But let us mention also a counterexample, e.g. nondeterministic functions arrows, or more generally, the various implementations of binary relation arrows  there is no such sequencing of effect orders. Now let us see this fact on the mere mathematical concept of binary relations (not minding how it implemented): 

+  :<math>(\rho</math> <hask>&&&</hask> <math>\sigma) x \left\langle y_0, y_1\right\rangle \Leftrightarrow x \rho y_0 \land x \sigma y_1</math> 

+  :<math>(\rho</math> <hask></hask> <math>\sigma) \left(i:x\right) y \Leftrightarrow i\begin{cases}0:&x\rho y\\1:&x\sigma y\end{cases}</math> 

+  
+  The picture illustrating <hask>***</hask> in [http://en.wikibooks.org/wiki/Haskell/Understanding_arrows#.2A.2A.2A Haskell/Understanding arrows] article of Wikibooks suggests exactly such a view: order of side effects can be unimportant at some arrow instances, and the symmetry of the figure reflects this. In generally, however, the figure should use a notation for threading through side effects in a sequence. 

=== Stream processor === 
=== Stream processor === 

−  ==== IOlike things ==== 

+  The [http://homepages.cwi.nl/~tromp/cl/lazyk.html Lazy K programming language] is an interesting esoteric language (from the family of pure, lazy functional languages), whose I/O concept is approached by streams. 

−  ===== ===== 

+  Arrows are useful also to grasp the concept of stream processors. See details in 

+  * [http://www.carlssonia.org/ogi/ProdArrows/ ProdArrows  Arrows for Fudgets] written by [http://www.carlssonia.org/ Magnus Carlsson], 2001. 

+  * [http://www.haskell.org/arrows/biblio.html Generalising Monads to Arrows] written by [http://www.cse.chalmers.se/~rjmh/ John Hughes] (section 6, pages 2024) 

−  ===== Fudgets ===== 

+  ==== Functional I/O, graphical user interfaces ==== 

+  
+  * [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.695 On the Expressiveness of Purely Functional I/O Systems] written by Paul Hudak and Raman S. Sundaresh. 

+  * [http://www.altocumulus.org/Fudgets/ Fudgets] written by [http://www.altocumulus.org/~hallgren/ Thomas Hallgren] and [http://www.carlssonia.org/ Magnus Carlsson]. See also [http://www.carlssonia.org/ogi/ProdArrows/ Arrows for Fudgets] written by [http://www.carlssonia.org/ Magnus Carlsson], mentioning how these two concepts relate to each other. 

+  * [http://kevin.atkinson.dhs.org/fg/doc/FG.html FG] 

+  * [[Phooey]] 

+  * [[Grapefruit]] 

==== Dataflow languages ==== 
==== Dataflow languages ==== 

−  ===== Lucid ===== 

+  [http://www.soi.city.ac.uk/~ross/papers/fop.html Arrows and Computation] written by [http://www.soi.city.ac.uk/%7Eross/ Ross Paterson] mentions how to mimic dataflow programming in (lazy) functional languages. See more on Lucid's own HaskellWiki page: [[Lucid]]. 

+  
+  === Automaton === 

+  
+  To see what the concept itself means, see the Wikipedia articles [http://en.wikipedia.org/wiki/Finite_state_machine Finite state machine] and also [http://en.wikipedia.org/wiki/Automata_theory Automata theory]. 

+  
+  How these concepts can be implemented using the concept of arrow, can be found in the introductory articles on arrows mentioned above. 

+  
+  === Haskell XML Toolbox === 

+  [[HXT]] is an example of a real application using Arrows 

+  
+  == External links == 

+  * [http://www.cse.chalmers.se/~rjmh/afparrows.pdf ''Programming with Arrows'']  A tutorial introduction to arrows and arrow notation. Very didactic, introducing the arrow subclasses with detailed examples and rich explanations on the motivations of each decision. 

+  * [http://www.haskell.org/arrows/ Arrows: A General Interface to Computation] written by [http://www.soi.city.ac.uk/%7Eross/ Ross Paterson]. 

+  * [http://www.haskell.org/arrows/biblio.html ''Generalising Monads to Arrows'', and other papers] 

+  * [http://www.carlssonia.org/ogi/ProdArrows/ ProdArrows  Arrows for Fudgets] is also a good general material on the arrow concept (and also good for seeing, how arrows can be used to implement stream processors and Fudgets). It is written by [http://www.carlssonia.org/ Magnus Carlsson]. 

+  * [http://en.wikibooks.org/wiki/Haskell/Arrows Haskell/Arrows] on Wikibooks, followed by [http://en.wikibooks.org/wiki/Haskell/Understanding_arrows Understanding arrows], which uses a factory/conveyor belt metaphor for arrows. We know this image for [[monad]]s, but it is modified here for arrows, too. 

+  * HaWiki's [http://web.archive.org/web/20060901030914/http://haskell.org/hawiki/UnderstandingArrows UnderstandingArrows]. (An old page in the Web Archive (slow)) 

+  
+  
+  == See also == 

−  A fastfood implementation: 

+  * [[Causal Commutative Arrows]] 

−  * [[Media:Lucid.lhsLucid.lhs]] 

+  * [[Research papers/Monads and arrows#Arrows]]. 

−  * [[Media:Test.lhsTest.lhs]] 

+  * [[Arrow tutorial]]. 

−  A better implementation could be written using the arrow library available at the [http://www.haskell.org/arrows/download.html Downloads page of Arrows: A General Interface to Computation] written by [http://www.galois.com/~antony/ Antony Courtney], 

+  [[Category:Arrow]] 

−  [http://www.cs.nott.ac.uk/~nhn/ Henrik Nilsson] and 

−  [http://www.soi.city.ac.uk/~ross/ Ross Paterson]. 

−  [[Category:Standard classes]] 
Latest revision as of 20:01, 13 May 2020
import Control.Arrow 
Contents
Overview
Arrows, or Freydcategories, are a generalization of Monads.
"They can do everything monads can do, and more. They are roughly comparable to monads with a static component." However "Arrows do have some problems". (need a more useful comparison)
For an introduction, see #External links.
Library
 Control.Arrow is the standard library for arrows.
 Arrow transformer library (see the bottom of the page) is an extension with arrow transformers, subclasses, useful data types (Data.Stream, Data.Sequence).
 arrows package
Examples
Various concepts follow here, which can be seen as concrete examples covered by the arrow concept. Not all of them provide links to Haskellrelated materials: some of them are here only to give a selfcontained material (e.g. section #Automaton gives links only to the finite state concept itself.).
Practice
Reasons, when it may be worth of solving a specific problem with arrows (instead of monads) can be read in a message from Daan Leijen. But Leijen's post is rather old (2000). Arrows are now significantly easier to understand and use than they were back then. Eg, his example might be rewritten
test = proc _ > do question < ask < "what is the question ?" answer < ask < question returnA < ("the answer to '" ++ question ++ "' is " ++ answer)
(or something vaguely like that).
Function
Arrow operations arr
and >>>
are rather straightforward. For implementing first
and related concepts, see Prelude extensions#Tuples.
Parser
The reasons why the arrow concept can solve important questions when designing a parser library are explained in Generalising Monads to Arrows written by John Hughes.
A good example of the mentioned arrow parsers can be seen in A New Notation for Arrows written by Ross Paterson: figure 2, 4, 6 (page 3, 5, 6):
is represented with arrow parsers this way:
data Expr = Plus Expr Expr  Minus Expr Expr  ...
expr :: ParseArrow () Expr
expr = proc () > do
t < term < ()
exprTail < t
exprTail :: ParseArrow Expr Expr
exprTail = proc e > do
symbol PLUS < ()
t < term < ()
exprTail < Plus e t
<+> do
symbol MINUS < ()
t < term < ()
exprTail < Minus e t
<+> returnA < e
An arrow parser library: PArrows written by Einar Karttunen.
Another arrow parser implementation: LLParser.hs written by AnttiJuhani Kaijanaho (I read the reference to it in Shae Erisson's blog / journal).
The funny thing which took a long time for me to understand arrow parsers is a sort of differential approach  in contrast to the wellknown parser approaches. (I mean, in some way wellknown parsers are of differential approach too, in the sense that they manage state transitions where the states are remainder streams  but here I mean being differential in another sense: arrow parsers seem to me differential in the way how they consume and produce values  their input and output.)
The idea of borrowing this image from mathematical analysis comes from another topic: the version control systems article Integrals and derivatives written by Martin Pool uses a similar image.
Arrows and Computation written by Ross Paterson (pages 2, 6, 7) and ProdArrows  Arrows for Fudgets
written by Magnus Carlsson (page 9) mentions that computation (e.g. state) is threaded through the operands of &&&
operation.
I mean, even the mere definition of &&&
operation
p &&& q = arr dup >>> first p >>> second q
shows that the order of the computation (the side effects) is important when using &&&
, and this can be exemplified very well with parser arrows. See an example found in PArrows written by Einar Karttunen (see module Text.ParserCombinators.PArrow.Combinator
):
  Match zero or more occurrences of the given parser.
many :: MD i o > MD i [o]
many = MStar
  Match one or more occurrences of the given parser.
many1 :: MD i o > MD i [o]
many1 x = (x &&& MStar x) >>> pure (\(b,bs) > (b:bs))
The definition of between
parser combinator can show another example for the importance of the order in which the computation (e.g. the side effects) take place using &&&
operation:
between :: MD i t > MD t close > MD t o > MD i o
between open close real = open >>> (real &&& close) >>^ fst
A more complicated example (from the same module):
  Match one or more occurrences of the given parser separated by the separator.
sepBy1 :: MD i o > MD i o' > MD i [o]
sepBy1 p s = (many (p &&& s >>^ fst) &&& p) >>^ (\(bs,b) > bs++[b])
This makes clear that the order of effects of the operands of &&&
operation can be important. But let us mention also a counterexample, e.g. nondeterministic functions arrows, or more generally, the various implementations of binary relation arrows  there is no such sequencing of effect orders. Now let us see this fact on the mere mathematical concept of binary relations (not minding how it implemented):

&&&


The picture illustrating ***
in Haskell/Understanding arrows article of Wikibooks suggests exactly such a view: order of side effects can be unimportant at some arrow instances, and the symmetry of the figure reflects this. In generally, however, the figure should use a notation for threading through side effects in a sequence.
Stream processor
The Lazy K programming language is an interesting esoteric language (from the family of pure, lazy functional languages), whose I/O concept is approached by streams.
Arrows are useful also to grasp the concept of stream processors. See details in
 ProdArrows  Arrows for Fudgets written by Magnus Carlsson, 2001.
 Generalising Monads to Arrows written by John Hughes (section 6, pages 2024)
Functional I/O, graphical user interfaces
 On the Expressiveness of Purely Functional I/O Systems written by Paul Hudak and Raman S. Sundaresh.
 Fudgets written by Thomas Hallgren and Magnus Carlsson. See also Arrows for Fudgets written by Magnus Carlsson, mentioning how these two concepts relate to each other.
 FG
 Phooey
 Grapefruit
Dataflow languages
Arrows and Computation written by Ross Paterson mentions how to mimic dataflow programming in (lazy) functional languages. See more on Lucid's own HaskellWiki page: Lucid.
Automaton
To see what the concept itself means, see the Wikipedia articles Finite state machine and also Automata theory.
How these concepts can be implemented using the concept of arrow, can be found in the introductory articles on arrows mentioned above.
Haskell XML Toolbox
HXT is an example of a real application using Arrows
External links
 Programming with Arrows  A tutorial introduction to arrows and arrow notation. Very didactic, introducing the arrow subclasses with detailed examples and rich explanations on the motivations of each decision.
 Arrows: A General Interface to Computation written by Ross Paterson.
 Generalising Monads to Arrows, and other papers
 ProdArrows  Arrows for Fudgets is also a good general material on the arrow concept (and also good for seeing, how arrows can be used to implement stream processors and Fudgets). It is written by Magnus Carlsson.
 Haskell/Arrows on Wikibooks, followed by Understanding arrows, which uses a factory/conveyor belt metaphor for arrows. We know this image for monads, but it is modified here for arrows, too.
 HaWiki's UnderstandingArrows. (An old page in the Web Archive (slow))