Skip to main content
SpringerLink
Log in

A simple abstract machine to execute supercombinators

  • Models For Graph Reduction
  • Conference paper
  • First Online:
Graph Reduction (GR 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 279))

Included in the following conference series:

Abstract

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jon Fairbairn, Ponder and its Type System, University of Cambridge Computer Laboratory Technical Report No. 31, 1983.

    Google Scholar 

  2. 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. Jon Fairbairn & Stuart Wray, Code generation techniques for functional languages, 1986 ACM Conference on Lisp and Functional Programming (proceedings) pp 95–104

    Google Scholar 

  4. John Hughes, Strictness Detection in Non-Flat Domains, Institutionen för Informationsbehandling, Chalmers Tekniska Högskola, Göteborg, Draft, August 1985

    Google Scholar 

  5. Paul Hudak & Benjamin Goldberg, Serial Combinators: “Optimal” Grains of Parallelism, Yale University Department of Computer Science 1985

    Google Scholar 

  6. 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–132

    Google Scholar 

  7. Thomas Johnsson, The G-Machine: An Abstract Machine for Graph Reduction, Proceedings of SERC Declarative Programming Workshop at UCL, April 1983

    Google Scholar 

  8. Richard B. Kieburtz & Maria Napierala, A studied laziness—strictness analysis with stuctured data types, Oregon Graduate Centre, Extended Abstract, July 1985.

    Google Scholar 

  9. Mark Tillotson, Introduction to the Functional Programming Language “Ponder”, University of Cambridge Computer Laboratory Technical Report No. 65, May 1985.

    Google Scholar 

  10. Phil Wadler, Strictness Analysis on Non-Flat Domains, Programming Research Group, Oxford University, November 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cambridge University Computer Laboratory, Corn Exchange Street, CB2 3QG, Cambridge, United Kingdom

    Jon Fairbairn

Authors
  1. Jon Fairbairn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joseph H. Fasel Robert M. Keller

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fairbairn, J. (1987). A simple abstract machine to execute supercombinators. In: Fasel, J.H., Keller, R.M. (eds) Graph Reduction. GR 1986. Lecture Notes in Computer Science, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18420-1_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-18420-1_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18420-1

  • Online ISBN: 978-3-540-47963-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation