Call-pattern specialisation for Haskell programs

DOI10.1145/1291151.1291200MaRDI QIDQ5168935zbMATH OpenOpenAlexFDO

Authors Simon Peyton-Jones

Publication date 21 July 2014

Published in Proceedings of the 12th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1291151.1291200

zbMATH Keywords

optimisationcompilersHaskellspecialisation

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 1332628
• A transformation-based optimiser for Haskell
• Secrets of the Glasgow Haskell Compiler inliner
• Transformation by interpreter specialisation
• Algebraic specialization of generic functions for recursive types

Cited in

(3)

• Secrets of the Glasgow Haskell Compiler inliner
• Semantics and Pragmatics of New Shortcut Fusion Rules
• Algebraic dynamic programming on trees

Describes a project that uses

Uses Software

• GHC
• Haskell

This page was built for publication: Call-pattern specialisation for Haskell programs

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