|
definition:
|
goalConstrs :: PlGoal -> [(String,Int)]
goalConstrs pgoal = case pgoal of
PlLit _ ts -> unionMap termConstrs ts
PlNeg goals -> unionMap goalConstrs goals
PlCond gs1 gs2 gs3 -> unionMap (unionMap goalConstrs) [gs1,gs2,gs3]
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- The set of all data constructors together with their arities
--- used in a Prolog goal.
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({PlLit}) |-> _ || ({PlNeg}) |-> _ || ({PlCond}) |-> _}
|
|
name:
|
goalConstrs
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Language.Prolog.Types.PlGoal -> [(String, Prelude.Int)]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|