| Copyright | (c) 2010-2012 Benedikt Schmidt |
|---|---|
| License | GPL v3 (see LICENSE) |
| Maintainer | Benedikt Schmidt <beschmi@gmail.com> |
| Safe Haskell | None |
| Language | Haskell98 |
Term.Narrowing.Variants
Description
Computing and checking the variants of a term.
Documentation
computeVariantsCheck :: LNTerm -> WithMaude [LNSubstVFresh] #
variantsListCheck ts computes all variants of ts considered as a single term
without a bound or symmetry substitution. Before returning the result, it checks
if the set of variants is complete and minimal. If that is not the case, it
fails with an error