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

Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine - Version 2.5 (1992)

by Simon L Peyton Jones

Venue:	JOURNAL OF FUNCTIONAL PROGRAMMING
Citations:	180 - 19 self

Datum	Value	Source
TITLE	Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine Version 2.5	SVM HeaderParse 0.1
AUTHOR NAME	Simon L Peyton Jones	SVM HeaderParse 0.1
ABSTRACT	The Spineless Tagless G-machine is an abstract machine designed to support nonstrict 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 recognisably-functional language, which as well as a denotational meaning has a well-defined operational semantics. The STG language is the "abstract machine code " 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. Version 2.5 of this paper (minus appendix) appears in the Journal of Functional Programming 2(2) (April 1992), pp127-202. The indexing in the published version is one	SVM HeaderParse 0.1
CITATIONS	56 found	ParsCit 1.0