From: alain@dpt-info.u-strasbg.fr   
      
   nojb  writes:   
      
   > Suppose you want to translate an imperative language (e.g. a suitable   
   > subset of Pascal) into a functional language that does not have   
   > mutable variables (e.g. ML). Is this possible?   
      
   Yes it is.   
      
   > What would be the algorithms/theory that would be relevant to handle   
   > the mutability of the variables on the Pascal side? Is SSA relevant?   
      
   Yes, SSA is the way to go, from my point of view. Any program under SSA   
   form has en equivalent functional program. See "SSA is functional   
   programming", at   
      
   www.cs.princeton.edu/~appel/papers/ssafun.ps   
      
   -- Alain.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)