Language.Symantic.Lib.Applicative

Symantic for Applicative.

Class Sym_Applicative

class Sym_Functor term => Sym_Applicative term where

Minimal complete definition

Nothing

Methods

pure :: Applicative f => term a -> term (f a)

(<*>) :: Applicative f => term (f (a -> b)) -> term (f a) -> term (f b) infixl 4

(*>) :: Applicative f => term (f a) -> term (f b) -> term (f b) infixl 4

(<*) :: Applicative f => term (f a) -> term (f b) -> term (f a) infixl 4

pure :: Sym_Applicative (UnT term) => Trans term => Applicative f => term a -> term (f a)

(<*>) :: Sym_Applicative (UnT term) => Trans term => Applicative f => term (f (a -> b)) -> term (f a) -> term (f b) infixl 4

(*>) :: Sym_Lambda term => Applicative f => term (f a) -> term (f b) -> term (f b) infixl 4

(<*) :: Sym_Lambda term => Applicative f => term (f a) -> term (f b) -> term (f a) infixl 4

Instances

Sym_Applicative View

Defined in Language.Symantic.Lib.Applicative

Methods

pure :: Applicative f => View a -> View (f a)

(<*>) :: Applicative f => View (f (a -> b)) -> View (f a) -> View (f b)

(*>) :: Applicative f => View (f a) -> View (f b) -> View (f b)

(<*) :: Applicative f => View (f a) -> View (f b) -> View (f a)

Sym_Applicative Eval

Defined in Language.Symantic.Lib.Applicative

Methods

pure :: Applicative f => Eval a -> Eval (f a)

(<*>) :: Applicative f => Eval (f (a -> b)) -> Eval (f a) -> Eval (f b)

(*>) :: Applicative f => Eval (f a) -> Eval (f b) -> Eval (f b)

(<*) :: Applicative f => Eval (f a) -> Eval (f b) -> Eval (f a)

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

Defined in Language.Symantic.Lib.Applicative

Methods

pure :: Applicative f => BetaT term a -> BetaT term (f a)

(<*>) :: Applicative f => BetaT term (f (a -> b)) -> BetaT term (f a) -> BetaT term (f b)

(*>) :: Applicative f => BetaT term (f a) -> BetaT term (f b) -> BetaT term (f b)

(<*) :: Applicative f => BetaT term (f a) -> BetaT term (f b) -> BetaT term (f a)

(Sym_Applicative r1, Sym_Applicative r2, Sym_Lambda r1, Sym_Lambda r2) => Sym_Applicative (Dup r1 r2)

Defined in Language.Symantic.Lib.Applicative

Methods

pure :: Applicative f => Dup r1 r2 a -> Dup r1 r2 (f a)

(<*>) :: Applicative f => Dup r1 r2 (f (a -> b)) -> Dup r1 r2 (f a) -> Dup r1 r2 (f b)

(*>) :: Applicative f => Dup r1 r2 (f a) -> Dup r1 r2 (f b) -> Dup r1 r2 (f b)

(<*) :: Applicative f => Dup r1 r2 (f a) -> Dup r1 r2 (f b) -> Dup r1 r2 (f a)

Types

tyApplicative :: Source src => Type src vs a -> Type src vs (Applicative a)

Terms

teApplicative_pure :: TermDef Applicative '[Proxy a, Proxy f] (Applicative f #> (a -> f a))

teApplicative_app :: TermDef Applicative '[Proxy a, Proxy b, Proxy f] (Applicative f #> (f (a -> b) -> f a -> f b))

teApplicative_const :: TermDef Applicative '[Proxy a, Proxy b1, Proxy f] (Applicative f #> (f a -> f b1 -> f a))

teApplicative_tsnoc :: TermDef Applicative '[Proxy a, Proxy b, Proxy f] (Applicative f #> (f a -> f b -> f b))

Orphan instances

ClassInstancesFor Applicative

Methods

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

TypeInstancesFor Applicative

Methods

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

NameTyOf Applicative

Methods

nameTyOf :: proxy Applicative -> Mod NameTy

isNameTyOp :: proxy Applicative -> Bool

FixityOf Applicative

Methods

fixityOf :: proxy Applicative -> Maybe Fixity

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

Methods

moduleFor :: (PathMod, Module src ss)

Gram_Term_AtomsFor src ss g Applicative

Methods

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