Skip to main content
Log in

Editorial

  • Published:
Higher-Order and Symbolic Computation

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. 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)

    Google Scholar 

  2. 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

  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)

    Chapter  Google Scholar 

  4. Curien, P.-L.: An abstract framework for environment machines. Theor. Comput. Sci. 82, 389–402 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Krivine, J.-L.: Un interprète du λ-calcul. Brouillon. Available online at http://www.pps.jussieu.fr/~krivine/ (1985)

  6. Landin, P.J.: The next 700 programming languages. Commun. ACM 9(3), 157–166 (1966)

    Article  MATH  Google Scholar 

  7. 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]

  8. Reynolds, J.C.: The discoveries of continuations. Lisp Symb. Comput. 6(3/4), 233–247 (1993)

    Article  Google Scholar 

  9. Reynolds, J.C.: Definitional interpreters revisited. Higher-Order Symb. Comput. 11(4), 355–361 (1998)

    Article  MATH  Google Scholar 

  10. 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)

    Google Scholar 

  11. Sestoft, P.: Deriving a lazy abstract machine. J. Funct. Program. 7(3), 231–264 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Olivier Danvy.

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10990-007-9021-1

Navigation