Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell98 |
- data Identifier = Identifier {}
- mk :: Int -> String -> Identifier
- data Relation
- data Rule a = Rule {}
- strict :: Rule a -> Bool
- weak :: Rule a -> Bool
- equal :: Rule a -> Bool
- data RS s r = RS {}
- strict_rules :: RS s t -> [(t, t)]
- weak_rules :: RS s t -> [(t, t)]
- equal_rules :: RS s t -> [(t, t)]
- type TRS v s = RS s (Term v s)
- type SRS s = RS s [s]
- data Problem v s = Problem {}
- data Type
- data Strategy
- data Startterm
- type TES = TRS Identifier Identifier
- type SES = SRS Identifier
- mknullary :: String -> Identifier
- mkunary :: String -> Identifier
- from_strict_rules :: Bool -> [(t, t)] -> RS i t
- with_rules :: RS s t -> [Rule r] -> RS s r
- module TPDB.Data.Term
Documentation
data Identifier Source
Eq Identifier | |
Ord Identifier | |
Show Identifier | |
XmlContent Identifier | FIXME: move to separate module |
Hashable Identifier | |
Pretty Identifier | |
XRead Identifier | |
Reader Identifier | |
Typeable * Identifier | |
Reader (SRS Identifier) | |
Reader v => Reader (Term v Identifier) | |
Reader (TRS Identifier Identifier) |
mk :: Int -> String -> Identifier Source
Reader (SRS Identifier) | |
(Typeable * v, Typeable * c, XmlContent v, XmlContent c) => XmlContent (TRS v c) | |
(Pretty s, PrettyTerm r) => Pretty (RS s r) | |
Reader (TRS Identifier Identifier) | |
Typeable (* -> * -> *) RS |
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 TES = TRS Identifier Identifier Source
legaca stuff (used in matchbox)
type SES = SRS Identifier Source
mknullary :: String -> Identifier Source
mkunary :: String -> Identifier Source
from_strict_rules :: Bool -> [(t, t)] -> RS i t Source
with_rules :: RS s t -> [Rule r] -> RS s r Source
module TPDB.Data.Term