CurryInfo: call-analysis-3.2.0 / TRS.allFunctions
definition: 
|
allFunctions :: [Rule] -> [(String,Int)] allFunctions rules = nub (map funOf rules) where funOf (Rule rf args _) = (rf,length args) |
|
demand:
|
argument 1 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
get all function/arity pairs defined by a list of rules: |
|
failfree:
|
_ |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_) |-> {:,[]}}
|
|
name:
|
allFunctions |
|
precedence:
|
no precedence defined |
|
result-values:
|
{:,[]}
|
|
signature:
|
[Rule] -> [(String, Prelude.Int)] |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |