Implementing Lazy Functional Languages on Stock Hardware: The Spineless Tagless G-machine

Peyton Jones and Simon L

Abstract

"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,

Details

Publication typeArticle
Published inJournal of Functional Programming
URLhttp://www.cup.cam.ac.uk/
Pages127–202
Volume2
Number2
PublisherCambridge University Press
> Publications > Implementing Lazy Functional Languages on Stock Hardware: The Spineless Tagless G-machine