Higher-Order and Symbolic Computation

, Volume 20, Issue 3, pp 197–198 | Cite as

Editorial

Article

References

  1. 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. 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 Google Scholar
  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) CrossRefGoogle Scholar
  4. 4.
    Curien, P.-L.: An abstract framework for environment machines. Theor. Comput. Sci. 82, 389–402 (1991) MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Krivine, J.-L.: Un interprète du λ-calcul. Brouillon. Available online at http://www.pps.jussieu.fr/~krivine/ (1985)
  6. 6.
    Landin, P.J.: The next 700 programming languages. Commun. ACM 9(3), 157–166 (1966) MATHCrossRefGoogle Scholar
  7. 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] Google Scholar
  8. 8.
    Reynolds, J.C.: The discoveries of continuations. Lisp Symb. Comput. 6(3/4), 233–247 (1993) CrossRefGoogle Scholar
  9. 9.
    Reynolds, J.C.: Definitional interpreters revisited. Higher-Order Symb. Comput. 11(4), 355–361 (1998) MATHCrossRefGoogle Scholar
  10. 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. 11.
    Sestoft, P.: Deriving a lazy abstract machine. J. Funct. Program. 7(3), 231–264 (1997) MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of AarhusAarhusDenmark

Personalised recommendations