Secrets of the Glasgow Haskell Compiler inliner

DOI10.1017/S0956796802004331zbMath1037.68042OpenAlexW2130363716MaRDI QIDQ3149007

Simon Marlow, Simon L. Peyton Jones

Publication date: 2002

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796802004331

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Related Items

From natural semantics to C: A formal derivation of two STG machines ⋮ Costing stepwise refinements of parallel programs ⋮ A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations ⋮ Safety of Nöcker's strictness analysis ⋮ A survey of strategies in rule-based program transformation systems ⋮ Do judge a test by its cover. Combining combinatorial and property-based testing ⋮ Selective strictness and parametricity in structural operational semantics, inequationally ⋮ GHC ⋮ Preserving Sharing in the Partial Evaluation of Lazy Functional Programs ⋮ Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics

Uses Software

• Haskell