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. This paper is to appear in the Journal of Funct...

Citations

1224	Lectures on constructive functional programming - Bird - 1989
595	Compiling with Continuations - Appel - 1992
515	D.: Implementation of Functional Programming Languages - Jones, Lester - 1987
118	Efficient compilation of lazy evaluation - Johnsson - 1984
117	Report on the functional programming language Haskell, version 1.2 - Hudak, Jones, et al. - 1992
117	A correspondence between ALGOL 60 and Church's lambda notation - Landin - 1965
107	Continuation-passing, closure-passing style - Appel, Jim - 1989
73	Functional Programming: Application and Implementation, chapter Delayed evaluation - A functional approach to parallelism - Henderson - 1980
70	Realistic compilation by program transformation - Kelsey - 1989
61	SCHEME to C: a portable Scheme-to-C compiler - Bartlett - 1989
35	Compilation of functional languages by program transformation - Fradet - 1991
31	The Spineless G-machine - Burn, Jones - 1988
29	Tail recursion without space leaks - Jones - 1991
19	Some practical methods for rapid combinator reduction - Stoye, Clarke - 1984
12	ORBIT - an optimising compiler for Scheme - Kranz - 1988
10	A modular fullylazy lambda lifter in Haskell - Jones - 1991
4	Augustsson [1987], "Compiling lazy functional languages, part II - unknown authors
4	Johnsson [1985], "Lambda lifting: transforming programs to recursive equations - Thomas
4	1978], "Rabbit: a compiler for Scheme," AI-TR-474 - Steele
3	Feb 1989], "Simple generational garbage collection and fast allocation - Appel - 1989
3	Apr 1989], "Why functional programming matters - Hughes - 1998
2	A porterfield - Alverson, Callahan, et al. - 1990
2	1987], "Garbage collection can be faster than stack allocation - Appel - 1987
2	Augustsson & T Johnsson [Sept 1989], "Parallel graph reduction with the ! ; G ?- machine - unknown authors
2	JG Morrisett [Dec 1990], "Adding threads to Standard ML - Cooper
2	Johnsson [1987], "Compiling lazy functional languages - Thomas
2	A Acharya & P Lee [July 1992], "No assembly required: compiling Standard ML to C - Tarditi
1	Arvind [June 1991], "A syntactic approach to program transformations - Ariola
1	Apr 1978], "List processing in real time on a serial computer - Baker
1	P Hudak & J Young [1988], "Code optimizations for lazy evaluation - Bloss
1	DJ McNally [1989], "CASE - a lazy version of an SECD machine with a flat environment - Davie
1	RK Dybvig & C Bruggeman [June 1990], "Representing control in the presence of first-class continuations - Hieb
1	The Lazy Functional Abstract Machine - Ireland - 1992
1	Oct 1987], "A RISC architecture for symbolic computation - Kieburtz
1	B Agapiev [Sept 1988], "Optimising the evaluation of suspensions," in Proc workshop on implementation of lazy functional languages, Aspenas - Kieburtz
1	GL Burn [1991], "The HDG-machine: a highly distributed graph reducer for a transputer network - Kingdon, Lester
1	1990], "Functional programs as executable specifications - Koopman
1	Apr 1989], "Combinator graph reduction: a congruence and its applications - Lester
1	Generalised expression evaluation," in Proc workshop on implementation of lazy functional languages, Aspenas - Meijer - 1988
1	Apr 1991], "How to do machine-independent fast threaded code - Miranda
1	Jones [1988], "FLIC - a functional language intermediate code - Peyton
1	Jones & DR Lester [1992], Implementing functional languages: a tutorial - Peyton
1	D Wakeling [Apr 1992], "Heap profiling of lazy functional programs - Runciman
1	Aug 1991], "Combining copying and compacting garbage collection - Sansom
1	Scheevel [Aug 1986], "NORMA - a graph reduction processor - Mark
1	Using and porting Gnu CC, Version 2.0," Free Software Foundation - Stallman - 1992
1	1979], "A new implementation technique for applicative languages - Turner