There once was a man named Krivine
Who invented a wond’rous machine.
It pushed and it popped
On abstractions it stopped;
That lean mean machine from Krivine.
Mitchell Wand
References
Benaissa, Z.-E.-A., Lescanne, P., Rose, K.H.: Modeling sharing and recursion for weak reduction strategies using explicit substitution. In: Kuchen, H., Swierstra, D. (eds.) Eighth International Symposium on Programming Language Implementation and Logic Programming, Aachen, Germany, September 1996. Lecture Notes in Computer Science, vol. 1140, pp. 393–407. Springer, New York (1996)
Biernacka, M., Danvy, O.: A concrete framework for environment machines. ACM Trans. Comput. Log. (2007, to appear). Available as the research report BRICS RS-06-3
Crégut, P.: An abstract machine for lambda-terms normalization. In: Wand, M. (ed.) Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Nice, France, June 1990, pp. 333–340. ACM Press, New York (1990)
Curien, P.-L.: An abstract framework for environment machines. Theor. Comput. Sci. 82, 389–402 (1991)
Krivine, J.-L.: Un interprète du λ-calcul. Brouillon. Available online at http://www.pps.jussieu.fr/~krivine/ (1985)
Landin, P.J.: The next 700 programming languages. Commun. ACM 9(3), 157–166 (1966)
Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of 25th ACM National Conference, Boston, MA, 1972, pp. 717–740. Reprinted in Higher-Order Symb. Comput. 11(4), 363–397 (1998), with a foreword [9]
Reynolds, J.C.: The discoveries of continuations. Lisp Symb. Comput. 6(3/4), 233–247 (1993)
Reynolds, J.C.: Definitional interpreters revisited. Higher-Order Symb. Comput. 11(4), 355–361 (1998)
Schmidt, D.A.: State transition machines for lambda calculus expressions. In: Jones, N.D. (ed.) Semantics-Directed Compiler Generation, Aarhus, Denmark, 1980. Lecture Notes in Computer Science, vol. 94, pp. 415–440. Springer, New York (1980)
Sestoft, P.: Deriving a lazy abstract machine. J. Funct. Program. 7(3), 231–264 (1997)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Danvy, O. Editorial. Higher-Order Symb Comput 20, 197–198 (2007). https://doi.org/10.1007/s10990-007-9021-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10990-007-9021-1