Peyton Jones and Simon L.
April 1992
"The Spineless Tagless G-Machine is an abstract machine designed to support 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,
![]() File |
In Journal of Functional Programming
Publisher Cambridge University Press
All copyrights reserved by Cambridge University Press 1992.
| Type | Article |
| URL | http://www.cup.cam.ac.uk/ |
| Pages | 127–202 |
| Volume | 2 |
| Number | 2 |