concat-examples-0.3.0.0: Some examples of compiling to categories
Safe HaskellSafe-Inferred
LanguageHaskell2010

ConCat.ADFun

Description

Automatic differentiation

Documentation

type D = GD (-+>) Source #

andDerF :: forall a b. (a -> b) -> a -> b :* (a -> b) Source #

andDerF' :: forall a b. (a -> b) -> a -> b :* (a -> b) Source #

derF :: forall a b. (a -> b) -> a -> a -> b Source #

andDerFL :: forall s a b. HasLin s a b => (a -> b) -> a -> b :* L s a b Source #

derFL :: forall s a b. HasLin s a b => (a -> b) -> a -> L s a b Source #

dualV :: forall s a. (HasLin s a s, IsScalar s) => (a -> s) -> a Source #

andGradFL :: (HasLin s a s, IsScalar s) => (a -> s) -> a -> s :* a Source #

gradF :: (HasLin s a s, IsScalar s) => (a -> s) -> a -> a Source #

linear1 :: (Representable f, Eq (Rep f), Num s) => (f s -> s) -> f s Source #

linearN :: (Representable f, Eq (Rep f), Distributive g, Num s) => (f s -> g s) -> (f :-* g) s Source #

type RepresentableV s a = (HasV s a, Representable (V s a)) Source #

type RepresentableVE s a = (RepresentableV s a, Eq (Rep (V s a))) Source #

type HasLinR s a b = (RepresentableVE s a, RepresentableV s b, Num s) Source #

linearNR :: (HasV s a, RepresentableVE s a, HasV s b, Distributive (V s b), Num s) => (a -> b) -> L s a b Source #

andDerFLR :: forall s a b. HasLinR s a b => (a -> b) -> a -> b :* L s a b Source #

derFLR :: forall s a b. HasLinR s a b => (a -> b) -> a -> L s a b Source #

dualVR :: forall s a. (HasV s a, RepresentableVE s a, IsScalar s, Num s) => (a -> s) -> a Source #

andGradFLR :: forall s a. (IsScalar s, RepresentableVE s a, Num s) => (a -> s) -> a -> s :* a Source #

gradFR :: forall s a. (IsScalar s, RepresentableVE s a, Num s) => (a -> s) -> a -> a Source #