Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
From MaRDI portal
Publication:3625516
DOI10.1017/S0956796800000319zbMath1159.68389WikidataQ56338062 ScholiaQ56338062MaRDI QIDQ3625516
Publication date: 5 May 2009
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items
From natural semantics to C: A formal derivation of two STG machines, On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation, Modular, higher order cardinality analysis in theory and practice, Explaining the lazy Krivine machine using explicit substitution and addresses, Improving the lazy Krivine machine, The next 700 Krivine machines, State-transition machines, revisited, Proving correctness of a compiler using step-indexed logical relations, The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving, NixOS: A purely functional Linux distribution, On graph rewriting, reduction, and evaluation in the presence of cycles, A verified framework for higher-order uncurrying optimizations, Abstract λ-Calculus Machines, Unnamed Item, A type system for the push-enter model, Specialisation of Higher-Order Functions for Debugging, Is the Optimal Implementation Inefficient? Elementarily Not, π-RED+ An interactive compiling graph reduction system for an applied λ-calculus, Structure and Properties of Traces for Functional Programs, Compiling laziness using projections
Cites Work
