Abstract
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges for optimising compilers. We report practical experiments using novel variants of supercompilation, with special attention to let bindings and the generalisation technique. © Springer-Verlag Berlin Heidelberg 2008.
Cite
CITATION STYLE
Mitchell, N., & Runciman, C. (2008). A supercompiler for core Haskell. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5083 LNCS, pp. 147–164). https://doi.org/10.1007/978-3-540-85373-2_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
