[1] : The Free On-line Dictionary of Computing (27 SEP 03)

tail recursion modulo cons
     
         a generalisation of tail recursion
        introduced by d.h.d. warren.  it applies when the last thing a
        function does is to apply a constructor functions e.g. cons
        to an application of a non-primitive function.  this is
        transformed into a tail call to the function which is also
        passed a pointer to where its result should be written.  e.g.
     
        	f      = 
        	f x:xs = 1 : f xs
     
        is transformed into pseudo c/haskell:
     
        	f  = 
        	f l  = f' l allocate_cons
     
        	f'      p =  p = nil;
        			return p
        		      
        	f' x:xs p =  cell = allocate_cons;
        		        p = cell;
        			cell.head = 1;
        			return f' xs cell.tail
        		      
     
        where allocate_cons returns the address of a new cons cell, p
        is the location pointed to by p and c is the address of c.
     
        d.h.d. warren, dai research report 141, university of
        edinburgh 1980.
     
        1995-03-06
     
     
see also:
tail recursion c haskell  p = nil; return p   cell = allocate_cons; p = cell; cell.head = 1; return f' xs cell.tail  

Cons >> C Words
Cons, definition of term: Cons
cons_pag1.html

Cat O Nine Tail >> C Words
Cat O Nine Tail, definition of term: Cat O Nine Tail
cat+o+nine+tail_pag1.html