Re: [Haskell-cafe] Graph theory analysis of Haskell code

On Thu, Dec 06, 2007 at 09:34:30AM +0100, Ketil Malde wrote:

"Tim Chevalier" writes:

...

This is very well-trodden ground, but if you familiarize yourself with the literature on the subject, then who knows, you may discover something new.

I'll just add that having a tool visualizing this would be very useful for refactoring code. If you e.g. use color to distinguish nodes/functions from different modules, you could use that information to decide to merge or split modules to minimize external interfaces.

You could also try to automatically cluster nodes, which would be more interesting theoretically, but IMO less likely to be practical.

Another option would be to couple this with profiling or coverage information to visualize something about the usage of paths and nodes in the call graph.

Indeed, a visualization tool like this would be cool! -- David Roundy Department of Physics Oregon State University