Optimizing Closures In Lazy Functional Languages
Room: BBL 061
Speaker: Atze van der Ploeg
Title: Optimizing closures in lazy functional languages
We discuss an optimization of closures (delayed function applications) in implementations of lazy functional languages, such as Haskell. Usually the pointers to arguments of a closure are copied into the closure to ensure that they are accessible when the closure is evaluated. Our optimization is to omit this copying by letting a closure reference the enclosing function context.