tct-2.0.1: A Complexity Analyser for Term Rewrite Systems

Portabilityunportable
Stabilityunstable
MaintainerMartin Avanzini <martin.avanzini@uibk.ac.at>
Safe HaskellNone

Tct.Proof

Description

This module defines proof objects.

Synopsis

Documentation

data Answer

The datatype Answer reflects the answer type from the complexity competition.

yesAnswer :: Answer

Abbreviation for 'CertAnswer $ certified (unknown, unknown)'.

certificate :: ComplexityProof p => p -> Certificate

returns the Certificate associated with the proof.

succeeded :: ComplexityProof p => p -> Bool

The predicate succeeded p holds iff answer p is of shape CertAnswer _.

failed :: ComplexityProof p => p -> Bool

Negation of succeeded.

isTimeout :: ComplexityProof p => p -> Bool

The predicate isTimeout p holds iff answer p is of shape TimeoutAnswer _.

data PPMode

Constructors

ProofOutput

standard proof output

StrategyOutput

also output of extended strategy information

OverviewOutput

Only present an overview

Instances

type XmlContent = Content ()