Hoogle Search

Within LTS Haskell 24.0 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. module Control.Arrow

   Basic arrow definitions, based on

   • Generalising Monads to Arrows, by John Hughes, Science of Computer Programming 37, pp67-111, May 2000.
   plus a couple of definitions (returnA and loop) from
   • A New Notation for Arrows, by Ross Paterson, in ICFP 2001, Firenze, Italy, pp229-240.
   These papers and more information on arrows can be found at http://www.haskell.org/arrows/.

2. class Category a => Arrow (a :: Type -> Type -> Type)

   base	Control.Arrow

   The basic arrow class. Instances should satisfy the following laws:

   • arr id = id

   • arr (f >>> g) = arr f >>>
     arr g

   • first (arr f) = arr (first
     f)

   • first (f >>> g) = first f >>>
     first g

   • first f >>> arr fst =
     arr fst >>> f

   • first f >>> arr (id *** g) =
     arr (id *** g) >>> first f

   • first (first f) >>> arr assoc =
     arr assoc >>> first f

   where

   assoc ((a,b),c) = (a,(b,c))
   

   The other combinators have sensible default definitions, which may be overridden for efficiency.

3. module GHC.Tc.Gen.Arrow

   Typecheck arrow notation

4. module Control.Arrow

   No documentation available.

5. module Optics.Arrow

   No documentation available.

6. class Category a => Arrow (a :: Type -> Type -> Type)

   rio	RIO.Prelude.Types

   The basic arrow class. Instances should satisfy the following laws:

   • arr id = id

   • arr (f >>> g) = arr f >>>
     arr g

   • first (arr f) = arr (first
     f)

   • first (f >>> g) = first f >>>
     first g

   • first f >>> arr fst =
     arr fst >>> f

   • first f >>> arr (id *** g) =
     arr (id *** g) >>> first f

   • first (first f) >>> arr assoc =
     arr assoc >>> first f

   where

   assoc ((a,b),c) = (a,(b,c))
   

   The other combinators have sensible default definitions, which may be overridden for efficiency.

7. module Diagrams.TwoD.Arrow

   Drawing arrows in two dimensions. For a tutorial on drawing arrows using this module, see the diagrams website: https://diagrams.github.io/doc/arrow.html.

8. module GHC.Internal.Control.Arrow

   Basic arrow definitions, based on

   • Generalising Monads to Arrows, by John Hughes, Science of Computer Programming 37, pp67-111, May 2000.
   plus a couple of definitions (returnA and loop) from
   • A New Notation for Arrows, by Ross Paterson, in ICFP 2001, Firenze, Italy, pp229-240.
   These papers and more information on arrows can be found at http://www.haskell.org/arrows/.

9. class Category a => Arrow (a :: Type -> Type -> Type)

   ghc-internal	GHC.Internal.Control.Arrow

   The basic arrow class. Instances should satisfy the following laws:

   • arr id = id

   • arr (f >>> g) = arr f >>>
     arr g

   • first (arr f) = arr (first
     f)

   • first (f >>> g) = first f >>>
     first g

   • first f >>> arr fst =
     arr fst >>> f

   • first f >>> arr (id *** g) =
     arr (id *** g) >>> first f

   • first (first f) >>> arr assoc =
     arr assoc >>> first f

   where

   assoc ((a,b),c) = (a,(b,c))
   

   The other combinators have sensible default definitions, which may be overridden for efficiency.

10. type Arrow = ArrowType

    graphviz	Data.GraphViz.Attributes

    A particular way of drawing the end of an edge.

Page 1 of many | Next