A simple abstract machine to execute supercombinators

  • Jon Fairbairn
Models For Graph Reduction
Part of the Lecture Notes in Computer Science book series (LNCS, volume 279)


This paper gives a brief description of an abstract machine into which supercombinators may be compiled.

The description comprises a presentation of the instruction set of the machine, followed by the operational semantics of the normal order version, the algorithm to convert combinators to instructions and an outline of how the machine may be altered to perform lazy evaluation.


Current Frame Operational Semantic Base Reduction Abstract Machine Perfect Code 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Fairbairn 83]
    Jon Fairbairn, Ponder and its Type System, University of Cambridge Computer Laboratory Technical Report No. 31, 1983.Google Scholar
  2. [Fairbairn 85]
    Jon Fairbairn, Design and Implementation of a Simple Typed Language Based on the Lambda-Calculus, University of Cambridge Computer Laboratory Technical Report No. 75, May 1985.Google Scholar
  3. [Fairbairn & Wray 86]
    Jon Fairbairn & Stuart Wray, Code generation techniques for functional languages, 1986 ACM Conference on Lisp and Functional Programming (proceedings) pp 95–104Google Scholar
  4. [Hughes 85b]
    John Hughes, Strictness Detection in Non-Flat Domains, Institutionen för Informationsbehandling, Chalmers Tekniska Högskola, Göteborg, Draft, August 1985Google Scholar
  5. [Hudak & Goldberg 85]
    Paul Hudak & Benjamin Goldberg, Serial Combinators: “Optimal” Grains of Parallelism, Yale University Department of Computer Science 1985Google Scholar
  6. [Hudak & Kranz 84]
    Paul Hudak & David Kranz, A combinator based compiler for a functional language, 11th ACM Symposium on Principles of Programming Languages ACM Jan 1984, pp 121–132Google Scholar
  7. [Johnsson 83]
    Thomas Johnsson, The G-Machine: An Abstract Machine for Graph Reduction, Proceedings of SERC Declarative Programming Workshop at UCL, April 1983Google Scholar
  8. [Kieburtz & Napierala 85]
    Richard B. Kieburtz & Maria Napierala, A studied laziness—strictness analysis with stuctured data types, Oregon Graduate Centre, Extended Abstract, July 1985.Google Scholar
  9. [Tillotson 85]
    Mark Tillotson, Introduction to the Functional Programming Language “Ponder”, University of Cambridge Computer Laboratory Technical Report No. 65, May 1985.Google Scholar
  10. [Wadler 85]
    Phil Wadler, Strictness Analysis on Non-Flat Domains, Programming Research Group, Oxford University, November 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Jon Fairbairn
    • 1
  1. 1.Cambridge University Computer LaboratoryCambridgeUnited Kingdom

Personalised recommendations