> Does anyone know how to solve the parallel assignment problem?
> Name invented by me to describe this problem:

> x1,x2,x3..xn = e1,e2,e3 .. en

> where ei might contain the variables xj. (Note = here is assignment).

> The solution is a sequence of assignments involving
> only xi, ei, and ti, where ti are temporaries introduced
> to save the values of the expressions. For example,

Most ML compilers do this sort of thing to break big blocks of mutually
recursive functions into smaller such blocks.  The algorithm used is
generally to extract the "strongly connected components" of the graph.
Google for it and you'll surely find an algorithm.


        Stefan