John C. Reynolds« Definitional Interpreters for Higher-Order Programming Languages » () (DOI10.1145/800194.805852) — Proceedings of 25th ACM National Conference,
John C. Reynolds, « Definitional Interpreters Revisited », Higher-Order and Symbolic Computation, vol. 11, no 4, , p. 355-361 (DOI10.1023/A:1010075320153)
David A. Schmidt « State transition machines for lambda calculus expressions » () (DOI10.1007/3-540-10250-7_32) — Semantics-Directed Compiler Generation, LNCS 94,
David A. Schmidt, « State-transition machines, revisited », Higher-Order and Symbolic Computation, vol. 20, no 3, , p. 333-335 (DOI10.1007/s10990-007-9017-x)
Mads Sig Ager, Dariusz Biernacki, Olivier Danvy et Jan Midtgaard « A Functional Correspondence between Evaluators and Abstract Machines » () (DOI10.7146/brics.v10i13.21783) — 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'03),
Pierre-Louis Curien, « An Abstract Framework for Environment Machines », Theoretical Computer Science, vol. 82, no 2, , p. 389-402 (DOI10.1016/0304-3975(91)90230-Y)
Małgorzata Biernacka et Olivier Danvy (Article #6), « A Concrete Framework for Environment Machines », ACM Transactions on Computational Logic, vol. 9, no 1, , p. 1-30 (DOI10.7146/brics.v13i3.21909)
doi.org
Wouter Swierstra « From mathematics to abstract machine: A formal derivation of an executable Krivine machine » () (lire en ligne) — Proceedings of the Fourth Workshop on Mathematically Structured Fsunctional Programming (MSFP 2012),
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt, « Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines », LICS 2017, (lire en ligne)
[1] «_Xavier Leroy, The ZINC experiment: an economical implementation of the ML language, Inria, Rapport Technique 117, 1990 ».