Safe Haskell | None |
---|
internal representation of CPF termination proofs, see http://cl-informatik.uibk.ac.at/software/cpf/
- data CertificationProblem = CertificationProblem {}
- data Origin = ProofOrigin Tool
- data Tool = Tool {}
- data CertificationProblemInput = TrsInput {}
- data Proof = TrsTerminationProof TrsTerminationProof
- data Sharp i
- data DPS = forall s . (XmlContent s, Typeable s) => DPS [Rule (Term Identifier s)]
- data TrsTerminationProof
- = RIsEmpty
- | RuleRemoval { }
- | DpTrans { }
- | Semlab { }
- | Unlab { }
- | StringReversal { }
- data Model = FiniteModel {
- carrierSize :: Int
- data DpProof
- data OrderingConstraintProof = RedPair {}
- data Interpretation = Interpretation {}
- data Interpretation_Type = Matrix_Interpretation {}
- data Domain
- data Interpret = forall s . XmlContent s => Interpret {}
- data Value = Polynomial Polynomial
- data Polynomial
- data Coefficient
- = Vector [Coefficient]
- | Matrix [Coefficient]
- | forall a . XmlContent a => Coefficient_Coefficient a
- data Exotic
- class ToExotic a where
- data Identifier
- type TES = TRS Identifier Identifier
Documentation
data CertificationProblemInput Source
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) |
forall s . (XmlContent s, Typeable s) => DPS [Rule (Term Identifier s)] |
data Interpretation Source
data Polynomial Source
data Coefficient Source
Vector [Coefficient] | |
Matrix [Coefficient] | |
forall a . XmlContent a => Coefficient_Coefficient a |
data Identifier Source
Eq Identifier | |
Ord Identifier | |
Show Identifier | |
Typeable Identifier | |
XmlContent Identifier | FIXME: move to separate module |
Hashable Identifier | |
Pretty Identifier | |
XRead Identifier | |
Reader Identifier | |
Reader (SRS Identifier) | |
Reader v => Reader (Term v Identifier) | |
Reader (TRS Identifier Identifier) |
type TES = TRS Identifier IdentifierSource
legaca stuff (used in matchbox)