The one place for your designs
To enable design management, you'll need to meet the requirements. If you need help, reach out to our support team for assistance.
More aggressive optimizations for lambdas
In clean-and-itasks/iTasks-SDK!387 (merged) I noticed that writing \_ k -> key == k was faster than const ((==) key). This is even the case if const were a macro.
Is it possible to fill in arguments of lambdas when they are already known? For example, I would expect to see the same code generated for these two Start rules:
Start = ((\x _ -> x) ((==) 0)) () 1
Start = (\_ -> (==) 0) () 1