Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine

DOI10.1017/S0956796800000319zbMath1159.68389WikidataQ56338062 ScholiaQ56338062MaRDI QIDQ3625516

Simon L. Peyton Jones

Publication date: 5 May 2009

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

Mathematics Subject Classification ID

68N20: Theory of compilers and interpreters

68N18: Functional programming and lambda calculus

Related Items

The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving, Unnamed Item, Compiling laziness using projections, Is the Optimal Implementation Inefficient? Elementarily Not, From natural semantics to C: A formal derivation of two STG machines, Modular, higher order cardinality analysis in theory and practice, On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation, On graph rewriting, reduction, and evaluation in the presence of cycles, A verified framework for higher-order uncurrying optimizations, A type system for the push-enter model, Proving correctness of a compiler using step-indexed logical relations, Explaining the lazy Krivine machine using explicit substitution and addresses, Improving the lazy Krivine machine, The next 700 Krivine machines, State-transition machines, revisited, Specialisation of Higher-Order Functions for Debugging, Structure and Properties of Traces for Functional Programs, NixOS: A purely functional Linux distribution, π-RED⁺ An interactive compiling graph reduction system for an applied λ-calculus, Abstract λ-Calculus Machines

Cites Work

• Unnamed Item
• Unnamed Item
• Thunks
• List processing in real time on a serial computer
• A new implementation technique for applicative languages