1. Wadsworth C.P., Semantics and pragmatics of the lambda-calculus, Ph.D. thesis, University of Oxford, 1971.
2. A graph-like lambda calculus for which leftmost-outermost reduction is optimal, in Graph grammars and their application to Computer Science and Biology;Staples,1979
3. A new implementation technique for applicative languages;Turner;Software: Practice and Experience,1979
4. Glauert J.R.W., Kennaway J.R. and Sleep M.R. DACTL: A Computational Model and Compiler Target Language Based on Graph Reduction. ICL Technical Journal, V5, Issue3, May 1987 pp 509–540
5. Barendregt H.P., Eekelen M.C.J.D. van, Glauert J.R.W., Kennaway J.R., Plasmeijer M.J. and Sleep M.R. Towards an Intermediate Language based on Graph Rewriting. Journal of Parallel Computing 9, North Holland, 1989