Term.Narrowing.Variants.Compute

Computing the variants of a term.

Documentation

computeVariantsBound :: LNTerm -> Maybe Int -> WithMaude (Maybe [LNSubstVFresh])

computeVariants t d compute the variants of term t with bound d. The rewriting rules are taken from the Maude context.

computeVariants :: LNTerm -> WithMaude [LNSubstVFresh]

variantsList ts computes all variants of ts considered as a single term without a bound or symmetry substitution. The rewriting rules are taken from the Maude context.

for testing

compareSubstVariant :: LNTerm -> LNSubstVFresh -> LNSubstVFresh -> WithMaude (Maybe Ordering)

substCompareVariant t s1 t2 compares two substitutions using the variant order with respect to t.