I wonder whether it would be possible to look at dependencies the way McCabe looked at flow control. http://www.literateprogramming.com/mccabe.pdf http://www.l

I wonder whether it would be possible to look at dependencies the way McCabe looked at flow control. http://www.literateprogramming.com/mccabe.pdf http://www.literateprogramming.com/mccabe.pdf That is, we use a strategy for substituting away subgraphs; we can classify programs by what results from that process. It may turn out that there are particular problematic subgraphs to avoid.