Related articles |
---|
imperative-to-functional compiler n.oje.bar@gmail.com (nojb) (2011-01-17) |
Re: imperative-to-functional compiler pat@jantar.org (Patryk Zadarnowski) (2011-01-18) |
Re: imperative-to-functional compiler torbenm@diku.dk (2011-01-18) |
Re: imperative-to-functional compiler alain@dpt-info.u-strasbg.fr (Alain Ketterlin) (2011-01-18) |
Re: imperative-to-functional compiler martin@gkc.org.uk (Martin Ward) (2011-01-18) |
From: | nojb <n.oje.bar@gmail.com> |
Newsgroups: | comp.compilers |
Date: | Mon, 17 Jan 2011 18:53:35 -0800 (PST) |
Organization: | Compilers Central |
Keywords: | functional, question |
Posted-Date: | 18 Jan 2011 01:05:09 EST |
Hello,
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? What would be the
algorithms/theory that would be relevant to handle the mutability of
the variables on the Pascal side? Is SSA relevant?
Thanks!
N
Return to the
comp.compilers page.
Search the
comp.compilers archives again.