In something like Haskell or OCaml, it would be possible to verify the tree/graph at compile the time. That's why functional languages with powerful (or even de

In something like Haskell or OCaml, it would be possible to verify the tree/graph at compile the time. That's why functional languages with powerful (or even dependent) type systems are so popular!