Ideas.Common.Rewriting.Substitution

Description

Substitutions on terms. Substitutions are idempotent, and non-cyclic.

Synopsis

Documentation

Abstract data type for substitutions

Instances

Eq Substitution Source #
Methods (==) :: Substitution -> Substitution -> Bool # (/=) :: Substitution -> Substitution -> Bool #
Show Substitution Source #
Methods showsPrec :: Int -> Substitution -> ShowS # show :: Substitution -> String # showList :: [Substitution] -> ShowS #
Semigroup Substitution Source #
Methods (<>) :: Substitution -> Substitution -> Substitution # sconcat :: NonEmpty Substitution -> Substitution # stimes :: Integral b => b -> Substitution -> Substitution #
Monoid Substitution Source #
Methods mempty :: Substitution # mappend :: Substitution -> Substitution -> Substitution # mconcat :: [Substitution] -> Substitution #
Arbitrary Substitution Source #
Methods arbitrary :: Gen Substitution # shrink :: Substitution -> [Substitution] #

Returns the empty substitution

Returns a singleton substitution

Returns the domain of a substitution (as a set)

Lookups a variable in a substitution. Nothing indicates that the variable is not in the domain of the substitution

Combines two substitutions. The left-hand side substitution is first applied to the co-domain of the right-hand side substitution

Apply the substitution

Turns a list into a substitution