Hoogle Search
Within LTS Haskell 24.2 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
class Category a =>
Arrow (a :: Type -> Type -> Type)essence-of-live-coding LiveCoding 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
assoc ((a,b),c) = (a,(b,c))
The other combinators have sensible default definitions, which may be overridden for efficiency.-
No documentation available.
class Category a =>
Arrow (a :: Type -> Type -> Type)rebase Rebase.Prelude 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
assoc ((a,b),c) = (a,(b,c))
The other combinators have sensible default definitions, which may be overridden for efficiency.module Synthesizer.Causal.
Arrow No documentation available.
class Category a =>
Arrow (a :: Type -> Type -> Type)base-prelude BasePrelude 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
assoc ((a,b),c) = (a,(b,c))
The other combinators have sensible default definitions, which may be overridden for efficiency.newtype
Arrow (p :: k -> Type) (q :: k -> Type) (a :: k)rank2classes Rank2 Wrapper for functions that map the argument constructor type
Arrow :: (p a -> q a) -> Arrow (p :: k -> Type) (q :: k -> Type) (a :: k)rank2classes Rank2 No documentation available.
module Database.Relational.
Arrow This module defines arrow version combinators which improves type-safety on building queries. Referencing the local projected records may cause to break the result query. It is possible to controls injection of previous local projected records by restricting domain type of arrow. This idea is imported from Opaleye:
- https://github.com/tomjaguarpaw/haskell-opaleye
- https://github.com/khibino/haskell-relational-record/issues/19
module Synthesizer.Dimensional.
Arrow A wrapper around (->) or Causal.Process that adds amplitude handling to the Arrow paradigm. This wrapper unifies Synthesizer.Dimensional.Map and Synthesizer.Dimensional.Causal.Process.
Arrow :: (a, a) -> V3 a -> Color -> VisObject aVis Vis No documentation available.