Skip to main content
SpringerLink
Log in
Book cover

Workshop on Graph Reduction

GR 1986: Graph Reduction pp 275–296Cite as

Performance measurement of a G-machine implementation

  • Performance Modelling And Simulation
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Augustsson, L., "A Compiler for Lazy ML," Proc. of 1984 ACM Conf. on Lisp and Functional Programming, Austin, Texas, 1984, pp. 218–227.

    Google Scholar 

  2. Augustsson, L., "The revised G-machine," PMG Memo 45, Dept. of Computer Science, Chalmers University of Technology, Gothenburg, 1986.

    Google Scholar 

  3. Cardelli, L., "Compiling a functional language," Proc. of 1984 ACM Conf. on Lisp and Functional Programming, 1984, pp. 208–217.

    Google Scholar 

  4. Hudak, P., "Programming with and implementing functional arrays," Proceedings of the 1986 Graph Reduction Workshop, Santa Fe, New Mexico, 1986.

    Google Scholar 

  5. Hughes, R. J. M., "Super-combinators," Proc. of 1982 ACM Conf. on Lisp and Functional Programming, Pittsburgh, 1982, pp. 1–10.

    Google Scholar 

  6. Hughes, J., "Lazy memo-functions," in Functional Programming Languages and Computer Architecture, vol. 201, J. Jouannaud (ed.), Springer-Verlag, Nancy, 1985, pp. 129–146.

    Google Scholar 

  7. Johnsson, T., The G-machine — an abstract architecture for graph-reduction, Dept. of Computer Sciences, Chalmers Univ. of Technology, Gothenburg, 1983.

    Google Scholar 

  8. Johnsson, T., "Efficient compilation of lazy evaluation," Proc. of 1984 ACM/SIGPLAN Notices Conf. on Compiler Construction, Montreal, 1984.

    Google Scholar 

  9. Johnsson, T., "Lambda lifting: transforming programs to recursive equations," in Functional Programming Languages and Computer Architecture, vol. 201, J. Jouannaud (ed.), Springer-Verlag, Nancy, 1985, pp. 190–203.

    Google Scholar 

  10. Johnsson, T., "Generating target machine code from G-machine code," Proceedings of the 1986 Graph Reduction Workshop, Santa Fe, New Mexico, 1986.

    Google Scholar 

  11. Kieburtz, R. B., "The G-machine: a fast, graph-reduction evaluator," Proc. of IFIP Conf. on Functional Prog. Lang. and Computer Arch., Nancy, 1985.

    Google Scholar 

  12. Peyton-Jones, S. L., The implementation of functional programming languages, Prentice-Hall International, London, 1987.

    Google Scholar 

  13. Rankin, L. J., A dual-ported real memory architecture for the G-machine, M.S. thesis, Oregon Graduate Center, Beaverton, Oregon, 1986.

    Google Scholar 

  14. Stoye, W. R., Clarke, T. J. W. and Norman, A. C., "Some practical methods for rapid combinator reduction," Proc. 1984 ACM Sympos. on Lisp and Functional Programming, 1984, pp. 159–166.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oregon Graduate Center, 19600 N.W. von Neumann Dr., 97006, Beaverton, Oregon, USA

    Richard B. Kieburtz

Authors
  1. Richard B. Kieburtz
    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

Kieburtz, R.B. (1987). Performance measurement of a G-machine implementation. 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_61

Download citation

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

  • 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