| definition: |
extendGraphL :: Graph -> IEnv -> [IExpr] -> (Graph,[NodeID])
extendGraphL g0 _ [] = (g0,[])
extendGraphL g0 env (e:es) =
let (g1,n1) = extendGraph g0 env e
(g2,n ) = either (\nid -> (g1,nid)) (\nd -> addNode nd g1) n1
(g3,ns) = extendGraphL g2 env es
in (g3, n:ns)
|
| demand: |
argument 3 |
| deterministic: |
deterministic operation |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,{[]}) |-> {(,)} || (_,_,{:}) |-> {(,)}}
|
| name: |
extendGraphL |
| precedence: |
no precedence defined |
| result-values: |
{(,)}
|
| signature: |
ICurry.Graph.Graph -> [(Prelude.Int, Prelude.Int)] -> [ICurry.Types.IExpr] -> (ICurry.Graph.Graph, [Prelude.Int]) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |