apfelmus wrote:
Andrew Coppin wrote:I see lots of *trees*, but no general graphs. (As in, *data* structures having cycles in them. My *code* is often cyclic...)So what does a compiler do to typecheck it? It represents your code as a graph and calculates strongly connected components.
That's quite true - but *I* am not writing a compiler, am I? ;-) _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
