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

Contents

Description

This module implements the bounds processor.

Synopsis

Documentation

bounds :: InitialAutomaton -> Enrichment -> ProcessorInstance Bounds

This processor implements the bounds technique.

data InitialAutomaton

This datatype represents the initial automaton employed.

Constructors

Minimal

Employ a minimal set of states, separating constructors from defined symbols in the case of runtime complexity analysis.

PerSymbol

Employ a state per function symbol. Slower, but more precise compared to Minimal.

data Enrichment

This datatype represents the enrichment employed.

Constructors

Match

Matchbounds.

Roof

Roofbounds.

Top

Topbounds.

Processor

Proof Object