tct-2.0.1: A Complexity Analyser for Term Rewrite Systems

Portabilityunportable
Stabilityunstable
MaintainerMartin Avanzini <martin.avanzini@uibk.ac.at>, Andreas Schnabl <andreas.schnabl@uibk.ac.at>
Safe HaskellSafe-Infered

Tct.Method.Bounds.Violations

Description

This module implements constructs automata compatible with enriched systems, as employed in the bound processor.

Documentation

makeRuleCompatible :: Rule -> Enrichment -> Strictness -> WeakBoundedness -> Label -> Automaton -> Either Automaton Automaton

compatibleAutomaton :: SolverM m => Trs -> Trs -> Enrichment -> Automaton -> m Automaton