tpdb-0.9.8: Data Type for Rewriting Systems

Safe HaskellSafe-Inferred

TPDB.Data

Synopsis

Documentation

data Rule a Source

Constructors

Rule 

Fields

lhs :: a
 
rhs :: a
 
relation :: Relation
 
top :: Bool
 

Instances

Functor Rule 
Typeable1 Rule 
Eq a => Eq (Rule a) 
Ord a => Ord (Rule a) 
(Typeable t, XmlContent t) => XmlContent (Rule t) 
(HTypeable (Rule (Term v c)), XmlContent (Term v c)) => XmlContent (Rule (Term v c)) 
HTypeable (Rule (Term v c)) 
PrettyTerm a => Pretty (Rule a) 
Reader u => Reader (Rule u) 

data RS s r Source

Constructors

RS 

Fields

signature :: [s]

better keep order in signature (?)

rules :: [Rule r]
 
separate :: Bool

if True, write comma between rules

strict_rules :: RS s t -> [(t, t)]Source

weak_rules :: RS s t -> [(t, t)]Source

equal_rules :: RS s t -> [(t, t)]Source

type TRS v s = RS s (Term v s)Source

type SRS s = RS s [s]Source

data Problem v s Source

Constructors

Problem 

Instances

(Pretty s, Pretty r) => Pretty (Problem s r) 

data Type Source

Constructors

Termination 
Complexity 

Instances

data Strategy Source

Constructors

Full 
Innermost 
Outermost 

Instances

type TES = TRS Identifier IdentifierSource

legaca stuff (used in matchbox)

from_strict_rules :: Bool -> [(t, t)] -> RS i tSource

with_rules :: RS s t -> [Rule r] -> RS s rSource