From natural semantics to C: A formal derivation of two STG machines

DOI10.1017/S0956796808006746zbMath1159.68005OpenAlexW2125519268MaRDI QIDQ5302645

Alberto de la Encina, Ricardo Peña

Publication date: 8 January 2009

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

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

zbMATH Keywords

spineless tag-less G-machine

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (2)

A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation ⋮ Inter-deriving semantic artifacts for object-oriented programming

Uses Software

• Haskell
• GHC

Cites Work

• A transformation-based optimiser for Haskell
• Nominal unification
• Secrets of the Glasgow Haskell Compiler inliner
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• Deriving a lazy abstract machine
• Making a fast curry: push/enter vs. eval/apply for higher-order languages

This page was built for publication: From natural semantics to C: A formal derivation of two STG machines