Language.Hakaru.Syntax.Transform

The internal syntax of Hakaru transformations, which are functions on Hakaru terms which are neither primitive, nor expressible in terms of Hakaru primitives.

Transformation internal syntax

data TransformImpl

Some transformations have the same type and same semantics, but are implemented in multiple different ways. Such transformations are distinguished in concrete syntax by differing keywords.

Constructors

InMaple

InHaskell

Instances

Eq TransformImpl

Methods

(==) :: TransformImpl -> TransformImpl -> Bool

(/=) :: TransformImpl -> TransformImpl -> Bool

Data TransformImpl

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TransformImpl -> c TransformImpl

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TransformImpl

toConstr :: TransformImpl -> Constr

dataTypeOf :: TransformImpl -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TransformImpl)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TransformImpl)

gmapT :: (forall b. Data b => b -> b) -> TransformImpl -> TransformImpl

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TransformImpl -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TransformImpl -> r

gmapQ :: (forall d. Data d => d -> u) -> TransformImpl -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TransformImpl -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TransformImpl -> m TransformImpl

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TransformImpl -> m TransformImpl

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TransformImpl -> m TransformImpl

Ord TransformImpl

Methods

compare :: TransformImpl -> TransformImpl -> Ordering

(<) :: TransformImpl -> TransformImpl -> Bool

(<=) :: TransformImpl -> TransformImpl -> Bool

(>) :: TransformImpl -> TransformImpl -> Bool

(>=) :: TransformImpl -> TransformImpl -> Bool

max :: TransformImpl -> TransformImpl -> TransformImpl

min :: TransformImpl -> TransformImpl -> TransformImpl

Read TransformImpl

Methods

readsPrec :: Int -> ReadS TransformImpl

readList :: ReadS [TransformImpl]

readPrec :: ReadPrec TransformImpl

readListPrec :: ReadPrec [TransformImpl]

Show TransformImpl

Methods

showsPrec :: Int -> TransformImpl -> ShowS

show :: TransformImpl -> String

showList :: [TransformImpl] -> ShowS

data Transform :: [([Hakaru], Hakaru)] -> Hakaru -> * where

Transformations and their types. Like SCon.

Constructors

Expect :: Transform '[LC (HMeasure a), '('[a], HProb)] HProb

Observe :: Transform '[LC (HMeasure a), LC a] (HMeasure a)

MH :: Transform '[LC (a :-> HMeasure a), LC (HMeasure a)] (a :-> HMeasure (HPair a HProb))

MCMC :: Transform '[LC (a :-> HMeasure a), LC (HMeasure a)] (a :-> HMeasure a)

Disint :: TransformImpl -> Transform '[LC (HMeasure (HPair a b))] (a :-> HMeasure b)

Summarize :: Transform '[LC a] a

Simplify :: Transform '[LC a] a

Reparam :: Transform '[LC a] a

Instances

Eq (Transform args a)

Methods

(==) :: Transform args a -> Transform args a -> Bool

(/=) :: Transform args a -> Transform args a -> Bool

Show (Transform args a)

Methods

showsPrec :: Int -> Transform args a -> ShowS

show :: Transform args a -> String

showList :: [Transform args a] -> ShowS

Eq (Some2 Transform)

Methods

(==) :: Some2 Transform -> Some2 Transform -> Bool

(/=) :: Some2 Transform -> Some2 Transform -> Bool

Read (Some2 Transform)

Methods

readsPrec :: Int -> ReadS (Some2 Transform)

readList :: ReadS [Some2 Transform]

readPrec :: ReadPrec (Some2 Transform)

readListPrec :: ReadPrec [Some2 Transform]

Some utilities

transformName :: Transform args a -> String

The concrete syntax names of transformations.

allTransforms :: [Some2 Transform]

All transformations.

Mapping of input type to output type for transforms

typeOfTransform :: Transform as x -> SArgsSing as -> Sing x

Transformation contexts

newtype TransformCtx

The context in which a transformation is called. Currently this is simply the next free variable in the enclosing program, but it could one day be expanded to include more information, e.g., an association of variables to terms in the enclosing program.

Constructors

TransformCtx

Fields

• nextFreeVar :: Nat

Instances

Eq TransformCtx

Methods

(==) :: TransformCtx -> TransformCtx -> Bool

(/=) :: TransformCtx -> TransformCtx -> Bool

Ord TransformCtx

Methods

compare :: TransformCtx -> TransformCtx -> Ordering

(<) :: TransformCtx -> TransformCtx -> Bool

(<=) :: TransformCtx -> TransformCtx -> Bool

(>) :: TransformCtx -> TransformCtx -> Bool

(>=) :: TransformCtx -> TransformCtx -> Bool

max :: TransformCtx -> TransformCtx -> TransformCtx

min :: TransformCtx -> TransformCtx -> TransformCtx

Show TransformCtx

Methods

showsPrec :: Int -> TransformCtx -> ShowS

show :: TransformCtx -> String

showList :: [TransformCtx] -> ShowS

Semigroup TransformCtx

Methods

(<>) :: TransformCtx -> TransformCtx -> TransformCtx

sconcat :: NonEmpty TransformCtx -> TransformCtx

stimes :: Integral b => b -> TransformCtx -> TransformCtx

Monoid TransformCtx

Methods

mempty :: TransformCtx

mappend :: TransformCtx -> TransformCtx -> TransformCtx

mconcat :: [TransformCtx] -> TransformCtx

class HasTransformCtx x where

The class of types which have an associated context

Minimal complete definition

ctxOf

Methods

ctxOf :: x -> TransformCtx

Instances

ABT syn abt => HasTransformCtx (abt xs a)

Methods

ctxOf :: abt xs a -> TransformCtx

HasTransformCtx (Variable a)

Methods

ctxOf :: Variable a -> TransformCtx

unionCtx :: TransformCtx -> TransformCtx -> TransformCtx

The union of two contexts

minimalCtx :: TransformCtx

The smallest possible context, i.e. a default context suitable for use when performing induction on terms which may contain transformations as subterms.

Transformation tables

newtype TransformTable abt m

A functional lookup table which indicates how to expand transformations. The function returns Nothing when the transformation shouldn't be expanded. When it returns Just k, k is passed an SArgs and a TransformCtx.

Constructors

TransformTable

Fields

• lookupTransform :: forall as b. Transform as b -> Maybe (TransformCtx -> SArgs abt as -> m (Maybe (abt '[] b)))

lookupTransform' :: Applicative m => TransformTable abt m -> Transform as b -> TransformCtx -> SArgs abt as -> m (Maybe (abt '[] b))

A variant of lookupTransform which joins the two layers of Maybe.

simpleTable :: Applicative m => (forall as b. Transform as b -> Maybe (TransformCtx -> SArgs abt as -> Maybe (abt '[] b))) -> TransformTable abt m

Builds a simple transformation table, i.e. one which doesn't make use of the monadic context. Such a table is valid in every Applicative context.

unionTable :: TransformTable abt m -> TransformTable abt m -> TransformTable abt m

Take the left-biased union of two transformation tables

someTransformations :: [Some2 Transform] -> TransformTable abt m -> TransformTable abt m

Intersect a transformation table with a list of transformations