Re:Morte: an intermediate language for super-optimizing func...
by chongli on Friday September 12, 2014 @11:44PM
(#8311583)
Haskell already does something almost like this. Expressions such as "factorial 5" may be lifted to the top level as a Constant Applicative Form (CAF). This allows the result to be computed once the first time they are needed and then subsequently shared, even across function invocations.
The advantage of this approach over doing it at compile time is that you don't risk blowing up your compilation time.
The advantage of this approach over doing it at compile time is that you don't risk blowing up your compilation time.