A transformation-based optimiser for Haskell

DOI10.1016/S0167-6423(97)00029-4MaRDI QIDQ1818319zbMATH OpenOpenAlexFDO

Authors Simon Peyton-Jones, André L. M. Santos

Publication date 4 January 2000

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6423(97)00029-4

zbMATH Keywords

compilationGlasgow Haskell compiler

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• Secrets of the Glasgow Haskell Compiler inliner
• Worker/wrapper/makes it/faster
• Transformation by interpreter specialisation
• Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^†
• Call-pattern specialisation for Haskell programs

Cited in

(15)

• A higher-order strategy for eliminating common subexpressions
• A survey of strategies in rule-based program transformation systems
• Worker/wrapper/makes it/faster
• Fusing logic and control with local transformations: an example optimization
• Type-safe code transformations in Haskell
• Using Template Haskell for abstract interpretation
• Secrets of the Glasgow Haskell Compiler inliner
• From Interpretation to Compilation
• The worker/wrapper transformation
• Data Movement Optimisation in Point-Free Form
• Call-pattern specialisation for Haskell programs
• From natural semantics to C: A formal derivation of two STG machines
• Modular, higher order cardinality analysis in theory and practice
• Higher-order matching for program transformation
• Improving Haskell

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: A transformation-based optimiser for Haskell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818319)