term-rewriting-0.5: Term Rewriting Library
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.Rewriting.Substitution.Type

Synopsis

Documentation

type Subst f v = GSubst v f v Source #

A substitution, mapping variables to terms. Substitutions are equal to the identity almost everywhere.

data GSubst v f v' Source #

A generalised? substitution: a finite, partial map from variables to terms with a different variable type.

Instances

Instances details
(Pretty v, Pretty f, Pretty v') => Pretty (GSubst v f v') Source # 
Instance details

Defined in Data.Rewriting.Substitution.Pretty

Methods

pretty :: GSubst v f v' -> Doc #

prettyList :: [GSubst v f v'] -> Doc #

(Show v, Show v', Show f) => Show (GSubst v f v') Source # 
Instance details

Defined in Data.Rewriting.Substitution.Type

Methods

showsPrec :: Int -> GSubst v f v' -> ShowS #

show :: GSubst v f v' -> String #

showList :: [GSubst v f v'] -> ShowS #

utilities not reexported from Substitution

fromMap :: Map v (Term f v') -> GSubst v f v' Source #

toMap :: GSubst v f v' -> Map v (Term f v') Source #