|
definition:
|
isCompleteConstructorList :: [(QName,ConsInfo)] -> [QName] -> Bool
isCompleteConstructorList _ [] = False
isCompleteConstructorList consinfos (c:cs)
| null (fst c) = False -- literals are never complete
| otherwise = all (`elem` cs) (map fst (siblingsOfCons consinfos c))
|
|
demand:
|
argument 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Is a non-empty list of constructors complete, i.e., does it contain
--- all the constructors of a type?
--- The first argument contains information about all constructors in a program.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,{[]}) |-> {False} || (_,{:}) |-> _}
|
|
name:
|
isCompleteConstructorList
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
[((String, String), (Prelude.Int, ConsType, [((String, String), Prelude.Int)]))]
-> [(String, String)] -> Prelude.Bool
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|