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

@article{citeulike:4313875, abstract = {The Spineless Tagless G-machine is an abstract machine designed to support non-strict higher-order functional languages. This presentation of the machine falls into three parts. Firstly, we give a general discussion of the design issues involved in implementing non-strict functional languages. Next, we present the STG language, an austere but recognizably-functional language, which as well as a denotational meaning has a well-defined operational semantics. The STG language is the for the Spineless Tagless G-machine. Lastly, we discuss the mapping of the STG language onto stock hardware. The success of an abstract machine model depends largely on how efficient this mapping can be made, though this topic is often relegated to a short section. Instead, we give a detailed discussion of the design issues and the choices we have made. Our principal target is the C language, treating the C compiler as a portable assembler.}, author = {Simon}, citeulike-article-id = {4313875}, citeulike-linkout-0 = {http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=1457324}, citeulike-linkout-1 = {http://dx.doi.org/10.1017/S0956796800000319}, doi = {10.1017/S0956796800000319}, journal = {Journal of Functional Programming}, keywords = {functionalprogramming, implementation}, number = {02}, pages = {127--202}, posted-at = {2009-04-15 16:09:46}, priority = {2}, title = {Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine}, url = {http://dx.doi.org/10.1017/S0956796800000319}, volume = {2}, year = {1992} }

TY - JOUR ID - citeulike:4313875 L3 - citeulike-article-id:4313875 N2 - The Spineless Tagless G-machine is an abstract machine designed to support non-strict higher-order functional languages. This presentation of the machine falls into three parts. Firstly, we give a general discussion of the design issues involved in implementing non-strict functional languages. Next, we present the STG language, an austere but recognizably-functional language, which as well as a denotational meaning has a well-defined operational semantics. The STG language is the for the Spineless Tagless G-machine. Lastly, we discuss the mapping of the STG language onto stock hardware. The success of an abstract machine model depends largely on how efficient this mapping can be made, though this topic is often relegated to a short section. Instead, we give a detailed discussion of the design issues and the choices we have made. Our principal target is the C language, treating the C compiler as a portable assembler. IS - 02 JF - Journal of Functional Programming EP - 202 TI - Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine VL - 2 SP - 127 KW - functionalprogramming KW - implementation AU - Simon PY - 1992/// UR - http://dx.doi.org/10.1017/S0956796800000319 ER -