|
definition:
|
genCons2 :: (a1 -> a2 -> b) -> SearchTree a1 -> SearchTree a2 -> SearchTree b
genCons2 c gena1 gena2 =
valsTo gena1 (\a1 ->
valsTo gena2 (\a2 -> Value (c a1 a2)))
|
|
demand:
|
argument 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Constructs a generator for a binary constructor where the generators
--- for the argument types are provided.
|
|
failfree:
|
(_, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> _}
|
|
name:
|
genCons2
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
(a -> b -> c) -> Control.SearchTree.SearchTree a
-> Control.SearchTree.SearchTree b -> Control.SearchTree.SearchTree c
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|