|
definition:
|
cnf :: Boolean -> Boolean
cnf (Var x) = Or [Var x]
cnf (Not v) = Or [Not v]
cnf (And fs) = And (map cnf fs)
cnf (Or []) = Or []
cnf (Or [f]) = cnf f
cnf (Or (f1:f2:fs)) = dist (cnf f1) (cnf (Or (f2:fs)))
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({Var}) |-> {Or} || ({Not}) |-> {Or} || ({And}) |-> {And} || ({Or}) |-> {And,Or}}
|
|
name:
|
cnf
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{And,Or}
|
|
signature:
|
Dimacs.Types.Boolean -> Dimacs.Types.Boolean
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|