definition: |
trCPattern :: (CVarIName -> a) -> (CLiteral -> a) -> (QName -> [a] -> a) -> (CVarIName -> a -> a) -> (QName -> [a] -> a) -> (QName -> [CField a] -> a) -> CPattern -> a trCPattern fv fl fc fa ff fr pattern = trP pattern where trP (CPVar pvar) = fv pvar trP (CPLit lit) = fl lit trP (CPComb c pats) = fc c (map trP pats) trP (CPAs v pat) = fa v (trP pat) trP (CPFuncComb fn pats) = ff fn (map trP pats) trP (CPLazy pat) = trP pat trP (CPRecord r fs) = fr r (map (\(n,p) -> (n,trP p)) fs) |
demand: |
argument 7 |
deterministic: |
deterministic operation |
documentation: |
--- Transforms a pattern. |
failfree: |
(_, _, _, _, _, _, _) |
indeterministic: |
referentially transparent operation |
infix: |
no fixity defined |
iotype: |
{(_,_,_,_,_,_,_) |-> _} |
name: |
trCPattern |
precedence: |
no precedence defined |
result-values: |
_ |
signature: |
((Prelude.Int, String) -> a) -> (AbstractCurry.Types.CLiteral -> a) -> ((String, String) -> [a] -> a) -> ((Prelude.Int, String) -> a -> a) -> ((String, String) -> [a] -> a) -> ((String, String) -> [((String, String), a)] -> a) -> AbstractCurry.Types.CPattern -> a |
solution-complete: |
operation might suspend on free variables |
terminating: |
possibly non-terminating |
totally-defined: |
reducible on all ground data terms |