Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Documentation
The fact that goes into the entry of a dominator analysis: the first node is dominated only by the entry point, which is represented by the empty list of labels.
Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
The fact that goes into the entry of a dominator analysis: the first node is dominated only by the entry point, which is represented by the empty list of labels.