Data.Comp.Multi.Term

This module defines the central notion of mutual recursive (or, higher-order) terms and its generalisation to (higher-order) contexts. All definitions are generalised versions of those in Data.Comp.Term.

Documentation

data Cxt h f a i where

This data type represents contexts over a signature. Contexts are terms containing zero or more holes. The first type parameter is supposed to be one of the phantom types Hole and NoHole. The second parameter is the signature of the context. The third parameter is the type family of the holes. The last parameter is the index/label.

Constructors

Term :: f (Cxt h f a) i -> Cxt h f a i

Hole :: a i -> Cxt Hole f a i

Instances

HFunctor f => HFunctor (Cxt h f)

Methods

hfmap :: (f :-> g) -> Cxt h f f :-> Cxt h f g

HFoldable f => HFoldable (Cxt h f)

Methods

hfold :: Monoid m => Cxt h f (K m) :=> m

hfoldMap :: Monoid m => (a :=> m) -> Cxt h f a :=> m

hfoldr :: (a :=> (b -> b)) -> b -> Cxt h f a :=> b

hfoldl :: (b -> a :=> b) -> b -> Cxt h f a :=> b

hfoldr1 :: (a -> a -> a) -> Cxt h f (K a) :=> a

hfoldl1 :: (a -> a -> a) -> Cxt h f (K a) :=> a

HTraversable f => HTraversable (Cxt h f)

Methods

hmapM :: Monad m => NatM m a b -> NatM m (Cxt h f a) (Cxt h f b)

htraverse :: Applicative f => NatM f a b -> NatM f (Cxt h f a) (Cxt h f b)

EqHF f => EqHF (Cxt h f)

Methods

eqHF :: KEq g => Cxt h f g i -> Cxt h f g j -> Bool

(HFunctor f, OrdHF f) => OrdHF (Cxt h f)

From an OrdHF difunctor an Ord instance of the corresponding term type can be derived.

Methods

compareHF :: KOrd a => Cxt h f a i -> Cxt h f a j -> Ordering

(EqHF f, KEq a) => KEq (Cxt h f a)

Methods

keq :: Cxt h f a i -> Cxt h f a j -> Bool

(HFunctor f, OrdHF f, KOrd a) => KOrd (Cxt h f a)

Methods

kcompare :: Cxt h f a i -> Cxt h f a j -> Ordering

data Hole

Phantom type that signals that a Cxt might contain holes.

data NoHole

Phantom type that signals that a Cxt does not contain holes.

type Context = Cxt Hole

A context might contain holes.

type Term f = Cxt NoHole f (K ())

A (higher-order) term is a context with no holes.

type Const f = f (K ())

constTerm :: HFunctor f => Const f :-> Term f

This function converts a constant to a term. This assumes that the argument is indeed a constant, i.e. does not have a value for the argument type of the functor f.

unTerm :: Term f t -> f (Term f) t

This function unravels the given term at the topmost layer.

toCxt :: HFunctor f => Term f :-> Context f a

Cast a term over a signature to a context over the same signature.

simpCxt :: HFunctor f => f a i -> Context f a i