Re: Converting languages to a purely functional form

Dobes Vandermeer wrote:
>
> Purely functional programs are, as far as I can tell, much easier to
> operate on programmatically than regular procedural ones. Loops,
> destructive updates, etc. make many kinds of very powerful analyses
> rather difficult.
>
    ...


>
> The main problem here, is that once you've analysed all the data flow
> information you get from this conversion, you'd want to be able to
> generate efficient code anyway; e.g. you's still want to generate loops,
> not tail-recursive function calls. This might entail some serious
> additional optimizations/analyses just to get back where you started.
>
> Thoughts/Comments/References?




I though Appel had shown the equivalence of SSA-form and
functional languages.


If that's true - then you should be able to apply SSA-form
algorithms to a function language to arrive at the same
optimizations available there...


Or - am I missing something?


--
rivers@dignus.com Work: (919) 676-0847
Get your mainframe programming tools at http://www.dignus.com

Return to the comp.compilers page.
Search the comp.compilers archives again.