tpdb-1.2.0: Data Type for Rewriting Systems

Safe HaskellNone
LanguageHaskell98

TPDB.CPF.Proof.Type

Description

internal representation of CPF termination proofs, see http://cl-informatik.uibk.ac.at/software/cpf/

Synopsis

Documentation

data Origin Source

Constructors

ProofOrigin 

Fields

tool :: Tool
 

data Tool Source

Constructors

Tool 

Fields

name :: String
 
version :: String
 

data CertificationProblemInput Source

Constructors

TrsInput

this is actually not true, since instead of copying from XTC, CPF format repeats the definition of TRS, and it's a different one (relative rules are extra)

ComplexityInput 

data DPS Source

Constructors

forall s . (XmlContent s, Typeable s, Eq s) => DPS [Rule (Term Identifier s)] 

Instances

data ComplexityClass Source

Constructors

ComplexityClassPolynomial

it seems the degree must always be given in CPF, although the category spec also allows POLY http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/rules.php

Fields

degree :: Int
 

class ToExotic a where Source

Methods

toExotic :: a -> Exotic Source

type TES = TRS Identifier Identifier Source

legaca stuff (used in matchbox)