25 Jun
2007
25 Jun
'07
2:46 p.m.
Andrew Coppin wrote:
Lennart Augustsson wrote:
If you don't run into graphs you are either solving very peculiar problems, or you don't recognize them when you see them. They are everywhere.
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. Regards, apfelmus