From: haberg_20080406@math.su.se   
      
   Tony Finch wrote:   
   >>>> You can also do closure conversion: Transform the source program so   
   >>>> all building of closures is done at the source level.   
   >>> Are there some relatively well known systems that use this approach?   
   >> Many implementations of SML, including SML of New Jersey, do this.   
   >   
   > In the lazy functional programming language literature (i.e. mostly   
   > Haskell) it's often called "lambda lifting".   
      
   There is a description of it here:   
      http://en.wikipedia.org/wiki/Lambda_lifting   
      
      Hans Aberg   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)