| definition: |
pSucceed :: res -> Grappa t res pSucceed v g = (v, g) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Given an arbitrary value `v`, `pSucceed` always succeeds --- returning `v` as a result without any consumption of the input graph `g`. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> {(,)}}
|
| name: |
pSucceed |
| precedence: |
no precedence defined |
| result-values: |
{(,)}
|
| signature: |
a -> [(b, [Prelude.Int])] -> (a, [(b, [Prelude.Int])]) |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |