The spineless tagless G-machine
Simon Jones, Jon Salkild · 1989
The Spineless Tagless G-machine is an abstract machine based on graph reduction, designed as a target for compilers for non-strict functional languages.As its name implies, it is a development of earlier work, especially the G-machine and TIM.It has a number of unusual features: the abstract machine code is rather higher-level than is common, allowing better code generation; the representation of the graph eliminates most interpretive overheads; vectored returns from data structures give fast case-analysis; and the machine is readily extended for a parallel implementation.