G. Burn, S. L. Peyton-jones, J. D. Robson, and F. W. Burton, The spineless G-machine A linear space translation of functional programs to Turner combinators, Proc. of LFP'88, pp.244-258, 1984.

R. Douence and P. Fradet, Towards a taxonomy of functional language implementations, Proc of PLILP'95, pp.27-44, 1995.
DOI : 10.1007/BFb0026812

R. Douence and P. Fradet, A taxonomy of functional language implementations . Part I: call-by-value, 1996.

J. Fairbairn and S. Wray, Tim: A simple, lazy abstract machine to execute supercombinators, Proc of FPCA'87, pp.34-45, 1987.
DOI : 10.1007/3-540-18317-5_3

P. Fradet and D. L. Métayer, Compilation of functional languages by program transformation, Proc. of FPCA'85, pp.21-51, 1985.
DOI : 10.1145/114005.102805
URL : https://hal.archives-ouvertes.fr/inria-00075518

M. S. Joy, V. J. Rayward-smith, and F. W. Burton, Efficient combinator code, Computer Languages, vol.10, issue.3-4, 1985.
DOI : 10.1016/0096-0551(85)90017-7
URL : http://wrap.warwick.ac.uk/60770/1/joy_raywardsmith_cl.pdf

]. S. Peyton and . Jones, Implementing lazy functional languages on stock hardware: the spineless tagless G-machine, Journal of Functional Programming, vol.2, issue.112, pp.127-202, 1992.

R. Plasmeijer and M. Van-eekelen, Functional Programming and Parallel Graph Rewriting, 1986.

D. A. Turner, A new implementation technique for applicative languages, Software: Practice and Experience, vol.6, issue.1, pp.31-49, 1979.
DOI : 10.1002/spe.4380090105