Re:Optimising Haskell for a tight inner loop
by evmar on Wednesday January 08, 2014 @07:03PM
(#7027807)
Ironically, the C++ code he's attempting to match itself uses a higher-level language[1] to generate a soup of tables and gotos[2]. But I think that observation supports the point he'd likely make: Haskell allows both the higher-level expressions of problems that produce optimization opportunities while preserving the option of dropping down to low-level trickiness if that's what you really need.
[1] https://github.com/martine/ninja/blob/master/src/lexer.in.cc...
[2] https://github.com/martine/ninja/blob/master/src/lexer.cc#L1...