Language.Symantic.Lib.Functor

Symantic for Functor.

Class Sym_Functor

class Sym_Functor term where

Minimal complete definition

Nothing

Methods

fmap :: Functor f => term (a -> b) -> term (f a) -> term (f b)

fmap :: Sym_Functor (UnT term) => Trans term => Functor f => term (a -> b) -> term (f a) -> term (f b)

(<$>) :: (Sym_Functor term, Functor f) => term (a -> b) -> term (f a) -> term (f b) infixl 4

(<$) :: Functor f => term a -> term (f b) -> term (f a) infixl 4

(<$) :: Sym_Lambda term => Functor f => term a -> term (f b) -> term (f a) infixl 4

Instances

Sym_Functor View

Defined in Language.Symantic.Lib.Functor

Methods

fmap :: Functor f => View (a -> b) -> View (f a) -> View (f b)

(<$>) :: (Sym_Functor View, Functor f) => View (a -> b) -> View (f a) -> View (f b)

(<$) :: Functor f => View a -> View (f b) -> View (f a)

Sym_Functor Eval

Defined in Language.Symantic.Lib.Functor

Methods

fmap :: Functor f => Eval (a -> b) -> Eval (f a) -> Eval (f b)

(<$>) :: (Sym_Functor Eval, Functor f) => Eval (a -> b) -> Eval (f a) -> Eval (f b)

(<$) :: Functor f => Eval a -> Eval (f b) -> Eval (f a)

(Sym_Functor term, Sym_Lambda term) => Sym_Functor (BetaT term)

Defined in Language.Symantic.Lib.Functor

Methods

fmap :: Functor f => BetaT term (a -> b) -> BetaT term (f a) -> BetaT term (f b)

(<$>) :: (Sym_Functor (BetaT term), Functor f) => BetaT term (a -> b) -> BetaT term (f a) -> BetaT term (f b)

(<$) :: Functor f => BetaT term a -> BetaT term (f b) -> BetaT term (f a)

(Sym_Functor r1, Sym_Functor r2) => Sym_Functor (Dup r1 r2)

Defined in Language.Symantic.Lib.Functor

Methods

fmap :: Functor f => Dup r1 r2 (a -> b) -> Dup r1 r2 (f a) -> Dup r1 r2 (f b)

(<$>) :: (Sym_Functor (Dup r1 r2), Functor f) => Dup r1 r2 (a -> b) -> Dup r1 r2 (f a) -> Dup r1 r2 (f b)

(<$) :: Functor f => Dup r1 r2 a -> Dup r1 r2 (f b) -> Dup r1 r2 (f a)

Types

tyFunctor :: Source src => Type src vs a -> Type src vs (Functor a)

f1 :: Source src => LenInj vs => KindInj (K f) => Type src (a ': (Proxy f ': vs)) f

f2 :: Source src => LenInj vs => KindInj (K f) => Type src (a ': (b ': (Proxy f ': vs))) f

Terms

teFunctor_fmap :: TermDef Functor '[Proxy a, Proxy b, Proxy f] (Functor f #> ((a -> b) -> f a -> f b))

teFunctor_fmap_infix :: TermDef Functor '[Proxy a, Proxy b, Proxy f] (Functor f #> ((a -> b) -> f a -> f b))

teFunctor_const :: TermDef Functor '[Proxy a, Proxy b, Proxy f] (Functor f #> (a -> f b -> f a))

Orphan instances

ClassInstancesFor Functor

Methods

proveConstraintFor :: Source src => proxy Functor -> Type src vs q -> Maybe (Qual q)

TypeInstancesFor Functor

Methods

expandFamFor :: Source src => proxy Functor -> Len vs -> Const src fam -> Types src vs ts -> Maybe (Type src vs (Fam fam ts))

NameTyOf Functor

Methods

nameTyOf :: proxy Functor -> Mod NameTy

isNameTyOp :: proxy Functor -> Bool

FixityOf Functor

Methods

fixityOf :: proxy Functor -> Maybe Fixity

(Source src, SymInj ss Functor) => ModuleFor src ss Functor

Methods

moduleFor :: (PathMod, Module src ss)

Gram_Term_AtomsFor src ss g Functor

Methods

g_term_atomsFor :: [CF g (AST_Term src ss)]