|
definition:
|
forAll :: [Int] -> [Sort] -> Term -> Term
forAll vs ss t = case vs of
[] -> t
_ -> Forall (zipWith SV (map var2SMT vs) ss) t
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Construct universally quantified SMT-LIB term
|
|
failfree:
|
(_, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({[]},_,_) |-> _ || ({:},_,_) |-> {Forall}}
|
|
name:
|
forAll
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
[Prelude.Int] -> [Language.SMTLIB.Types.Sort] -> Language.SMTLIB.Types.Term
-> Language.SMTLIB.Types.Term
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|