-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1


On Feb 7, 2005, at 8:58 AM, skaller wrote:

> Yeah it can, it has been proven SSA is equivalent to
> a purely functional representation. Branches are done with CPS.
> Sorry I can't find the paper: the paper was actually written
> to explain *why* SSA is easy to analyse.
>
 From a reply to a post I made on <http://www.lambda-the-ultimate.org>, 
at <http://lambda-the-ultimate.org/node/view/511#comment-4021>:

"A Correspondence between Continuation-Passing Style and Static Single 
Assignment" at <http://mumble.net/~kelsey/papers/cps-ssa.ps.gz>, and 
"SSA is Functional Programming" at 
<http://www.cs.princeton.edu/~appel/papers/ssafun.pdf>.
>
> -- 
> John Skaller, mailto:skaller@users.sf.net
> voice: 061-2-9660-0850,
> snail: PO BOX 401 Glebe NSW 2037 Australia
> Checkout the Felix programming language http://felix.sf.net
>
>
>
> _______________________________________________
> Caml-list mailing list. Subscription management:
> http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
> Archives: http://caml.inria.fr
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs
>
Best regards,
Paul

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.0 (Darwin)

iEYEARECAAYFAkIHq+YACgkQO3fYpochAqLoHQCgsXHXbnGKKaZsn0irNPoX7hX2
DkkAoLB9wmglgErs4Ayj6SS6KrUt4P+5
=zN17
-----END PGP SIGNATURE-----