Recursion Removal Rules


The second phase:  
Transformation with accumulation  

flatll(x) = case x of 
    nil         -> nil
    Cons[x1,xs] -> append(x1,flatll(xs))

↓
flatll(x,<acc,num>) = case x of 
    nil         -> accnil
    Cons[x1,xs] -> append(x1,flatll(xs,<DUMMY,0>),
<acc,num>)