1. Ager, M.S., Biernacki, D., Danvy, O., Midtgaard, J.: A functional correspondence between evaluators and abstract machines. In: Miller, D. (ed.) Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP’03), pp. 8–19. ACM Press, Uppsala (2003)
2. Ariola, Z.M., Arvind, : Properties of a first-order functional language with sharing. Theor. Comput. Sci. 146(1&2), 69–108 (1995)
3. Barendregt, H.P.: Functional programming and lambda calculus. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, vol. B, Chap. 7, pp. 321–364. Elsevier and The MIT Press, Cambridge (1990)
4. Barendregt, H.P., van Eekelen, M.C. J.D., Glauert, J.R.W., Kennaway, R., Plasmeijer, M.J., Sleep, M.R.: Term graph rewriting. In: de Bakker,J., Nijman, A.J. Treleaven, P.C. (eds) PARLE, Parallel Architectures and Languages Europe, Vol. II: Parallel Languages, Number 259 in Lecture Notes in Computer Science. Springer, Eindhoven, The Netherlands, pp. 141–158 (1987)
5. Biernacka, M., Danvy, O.: A concrete framework for environment machines. ACM Trans. Comput. Logic 9(1), 1–30 (2007)