| definition: |
tLet :: [(SVar, Term)] -> Term -> Term tLet = Let |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Let expression. |
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {Let}}
|
| name: |
tLet |
| precedence: |
no precedence defined |
| result-values: |
{Let}
|
| signature: |
[(Prelude.Int, Term)] -> Term -> Term |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |