Module TRS

Definition of term rewriting systems

Summary of exported operations:

func :: String -> [Term] -> Term   
cons :: String -> [Term] -> Term   
varsOf :: Term -> [Int]   
fSubterms :: Term -> [(String,[Term])]   
funcsInTerm :: Term -> [String]   
showBasicTerm :: Bool -> Term -> String   
showLetExp :: [Term] -> String   
showLambdaExp :: [Term] -> String   
showOperator :: String -> String   
encloseInPar :: Bool -> String -> String   
showRule :: Rule -> String   
showTRS :: [Rule] -> String   
allFunctions :: [Rule] -> [(String,Int)]   
funcRules :: String -> [Rule] -> [([Term],Term)]   
arityOf :: String -> [Rule] -> Int   
containsChoice :: Rule -> Bool   
addChoiceRules :: [Rule] -> [Rule]   
containsApply :: Rule -> Bool   
addApplyRules :: [Rule] -> [Rule]   

Exported datatypes:


Term

Constructors:

  • Var :: Int -> Term
  • Func :: FuncType -> String -> [Term] -> Term

FuncType

Constructors:

  • Def :: FuncType
  • Cons :: FuncType

Rule

Constructors:

  • Rule :: String -> [Term] -> Term -> Rule

Exported operations:

func :: String -> [Term] -> Term   

Further infos:
  • solution complete, i.e., able to compute all solutions

cons :: String -> [Term] -> Term   

Further infos:
  • solution complete, i.e., able to compute all solutions

varsOf :: Term -> [Int]   

fSubterms :: Term -> [(String,[Term])]   

funcsInTerm :: Term -> [String]   

showBasicTerm :: Bool -> Term -> String   

showLetExp :: [Term] -> String   

showLambdaExp :: [Term] -> String   

showOperator :: String -> String   

encloseInPar :: Bool -> String -> String   

showRule :: Rule -> String   

showTRS :: [Rule] -> String   

allFunctions :: [Rule] -> [(String,Int)]   

funcRules :: String -> [Rule] -> [([Term],Term)]   

arityOf :: String -> [Rule] -> Int   

containsChoice :: Rule -> Bool   

addChoiceRules :: [Rule] -> [Rule]   

containsApply :: Rule -> Bool   

addApplyRules :: [Rule] -> [Rule]