how to do constant folding algorithm for an optmizing compiler in haskell?
so this question might seem too newbie, but I’m already reading the book “Advanced Compiler Design and Implementation” by Steven Muchnick and in the first chapter of optimization it talks about constant folding.