Definition of term rewriting systems
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] |
Constructors:
Constructors:
Def
:: FuncType
Cons
:: FuncType
Constructors:
|
|
|
|
|
|
|
|
|
|
|
|
|