The G-machine as a representation of stack semantics

  • David Lester
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 274)


Abstract Machine Functional Language Graph Reduction Local Definition Head Normal Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    Thomas Johnsson. Compiling Lazy Functional Languages. PhD thesis, Chalmers Tekniska Högskola, Göteborg, Sweden, January 1987.Google Scholar
  2. [2]
    Thomas Johnsson. The G-machine. In Proceedings of the Workshop on Declarative Programming, University College, London, April 1983.Google Scholar
  3. [3]
    David Lester. A congruence proof for graph reduction. 1987. Unpublished.Google Scholar
  4. [4]
    R.E. Milne and C. Strachey. A Theory of Programming Language Semantics. Chapman and Hall, London, 1976.Google Scholar
  5. [5]
    R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348–375, December 1978.Google Scholar
  6. [6]
    Simon Peyton Jones. The Implementation of Functional Languages. Prentice Hall, Englewood Cliffs, NJ, USA, 1987.Google Scholar
  7. [7]
    Simon L. Peyton Jones. Directions in functional programming research. In David A. Duce, editor, Distributed Computing Systems Programme, chapter 14, pages 220–249, Peter Peregrinus Ltd., London, UK., 1984.Google Scholar
  8. [8]
    Joseph E. Stoy. The congruence of two programming language definitions. No. 4343.Google Scholar
  9. [9]
    Joseph E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. The MIT Series in Computer Science, The MIT Press, Cambridge, Massachusetts, 1977.Google Scholar
  10. [10]
    Joseph E. Stoy. Some Mathematical Aspects of Functional Programming. Lecture Notes, University of Newcastle upon Tyne, July 1981.Google Scholar
  11. [11]
    W.R. Stoye, T.J.W. Clarke, and A.C. Norman. Some practical methods for rapid combinator reduction. In Proceedings of the A.C.M. Symposium on Lisp and Functional Languages, Austin, August 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • David Lester
    • 1
  1. 1.Programming Research GroupOxfordEngland

Personalised recommendations