CurryInfo: failfree-4.0.0 / Curry2SMT.patternTest

definition:
patternTest :: TAPattern -> Term -> Term
patternTest (ALPattern _ l) be = tEqu be (lit2SMT l)
patternTest (APattern ty (qf,_) _) be = constructorTest True qf be ty
demand:
argument 1
deterministic:
deterministic operation
failfree:
(_, _)
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{({ALPattern},_) |-> {TComb} || ({APattern},_) |-> {TComb}}
name:
patternTest
precedence:
no precedence defined
result-values:
{TComb}
signature:
FlatCurry.Annotated.Types.APattern FlatCurry.Types.TypeExpr -> ESMT.Term
-> ESMT.Term
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
possibly non-reducible on same data term