[MLton-devel] The Essence of Compiling with Continuations Retrospective

Stephen Weeks MLton@mlton.org
Fri, 28 Mar 2003 13:13:56 -0800


Matthias responded personally to me with the following

> Your analysis is interesting. As you may know, Corky and I in our 
> first joint paper came up with the "semantic program dependence graph"
> which is more or less the SSA. We used den nat to figure out what a
> PDG was and realized that they had miswired some of the connections. 
> We also realized that they needed a valve node (now phi function) if
> they wanted to make the analysis and optimizations structural. 
> 
> I had always claimed that a functional program in a certain shape should
> be an SSA or actually that an SSA is just a special case of something 
> like a representation of a program with some 0CFA built in. I have the
> feeling that this is what you figured out. 


-------------------------------------------------------
This SF.net email is sponsored by:
The Definitive IT and Networking Event. Be There!
NetWorld+Interop Las Vegas 2003 -- Register today!
http://ads.sourceforge.net/cgi-bin/redirect.pl?keyn0001en
_______________________________________________
MLton-devel mailing list
MLton-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/mlton-devel