4 ms·
GHC Haskell does nearly all its optimisation using trees and a high-level functional IR, so I think you are understating trees.
by willtim 9y ago
GHC Haskell does nearly all its optimisation using trees and a high-level functional IR, so I think you are understating trees.
- seanmcdirmid 9y agoYes, but I don't think they require a low-level IR in that case (purity, no re-assignment, no loops). LLVM does not use trees at that level, for example, because they really need to use stuff like SSA, basic blocks, and so on.