| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Language.Symantic.Lib.Traversable
Description
Symantic for Traversable.
Synopsis
- class Sym_Traversable term where
- traverse :: Traversable t => Applicative f => term (a -> f b) -> term (t a) -> term (f (t b))
- tyTraversable :: Source src => Type src vs a -> Type src vs (Traversable a)
- teTraversable_traverse :: TermDef Traversable '[Proxy a, Proxy b, Proxy f, Proxy t] ((Traversable t # Applicative f) #> ((a -> f b) -> t a -> f (t b)))
Class Sym_Traversable
class Sym_Traversable term where Source #
Minimal complete definition
Nothing
Methods
traverse :: Traversable t => Applicative f => term (a -> f b) -> term (t a) -> term (f (t b)) Source #
traverse :: Sym_Traversable (UnT term) => Trans term => Traversable t => Applicative f => term (a -> f b) -> term (t a) -> term (f (t b)) Source #
Instances
| Sym_Traversable View Source # | |
Defined in Language.Symantic.Lib.Traversable Methods traverse :: (Traversable t, Applicative f) => View (a -> f b) -> View (t a) -> View (f (t b)) Source # | |
| Sym_Traversable Eval Source # | |
Defined in Language.Symantic.Lib.Traversable Methods traverse :: (Traversable t, Applicative f) => Eval (a -> f b) -> Eval (t a) -> Eval (f (t b)) Source # | |
| (Sym_Traversable term, Sym_Lambda term) => Sym_Traversable (BetaT term) Source # | |
Defined in Language.Symantic.Lib.Traversable Methods traverse :: (Traversable t, Applicative f) => BetaT term (a -> f b) -> BetaT term (t a) -> BetaT term (f (t b)) Source # | |
| (Sym_Traversable r1, Sym_Traversable r2) => Sym_Traversable (Dup r1 r2) Source # | |
Defined in Language.Symantic.Lib.Traversable Methods traverse :: (Traversable t, Applicative f) => Dup r1 r2 (a -> f b) -> Dup r1 r2 (t a) -> Dup r1 r2 (f (t b)) Source # | |
Types
tyTraversable :: Source src => Type src vs a -> Type src vs (Traversable a) Source #
Terms
teTraversable_traverse :: TermDef Traversable '[Proxy a, Proxy b, Proxy f, Proxy t] ((Traversable t # Applicative f) #> ((a -> f b) -> t a -> f (t b))) Source #
Orphan instances
| ClassInstancesFor Traversable Source # | |
Methods proveConstraintFor :: Source src => proxy Traversable -> Type src vs q -> Maybe (Qual q) # | |
| TypeInstancesFor Traversable Source # | |
Methods expandFamFor :: Source src => proxy Traversable -> Len vs -> Const src fam -> Types src vs ts -> Maybe (Type src vs (Fam fam ts)) # | |
| NameTyOf Traversable Source # | |
| FixityOf Traversable Source # | |
Methods fixityOf :: proxy Traversable -> Maybe Fixity # | |
| (Source src, SymInj ss Traversable) => ModuleFor src ss Traversable Source # | |
| Gram_Term_AtomsFor src ss g Traversable Source # | |
Methods g_term_atomsFor :: [CF g (AST_Term src ss)] # | |