Skip to main content
SpringerLink
Log in

Compiling pattern matching

  • Conference paper
  • First Online:
Functional Programming Languages and Computer Architecture (FPCA 1985)

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

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. L. Augustsson, "A Compiler for Lazy ML" in Proceedings of the 1984 LISP and Functional Programming Conference, Austin, Texas, (August 1984).

    Google Scholar 

  2. R. M. Burstall, D. B. MacQueen, and D. T. Sanella, "Hope: An Experimental Applicative Language", pp. 136–143 in Proceedings of the 1980 LISP Conference, Stanford, California (August 1980).

    Google Scholar 

  3. L. Cardelli, "Compiling a Functional Language" in Proceedings of the 1984 LISP and Functional Programming Conference, Austin, Texas, (August 1984).

    Google Scholar 

  4. D.P. Friedman and D.S. Wise, "Cons should not evaluate its arguments", pp. 257–284 in Automata, Languages and Programming, Edinburgh University Press, 1976

    Google Scholar 

  5. P. Henderson and J.H. Morris, "A Lazy Evaluator", pp. 95–103 in Principles of Programming Languages, Atlanta, Georgia, (January 1976)

    Google Scholar 

  6. T. Johnsson, "The G-machine: An abstract machine for graph reduction.", pp. 1–19 in Proceedings of the Declarative programming workshop, University College London, April 1983.

    Google Scholar 

  7. T. Johnsson, "Efficient Compilation of Lazy Evaluation", in Proceedings of the 1984 Symposium on Compiler Construction, (Montreal 1984)

    Google Scholar 

  8. R. Milner, "A theory of Type Polymorphism in Programming", Journal of Computer and System Sciences, Vol. 17 no. 3 pp. 348–375 (1978)

    Google Scholar 

  9. R. Milner, "Standard ML Proposal", Polymorphism: The ML/LCF/Hope Newsletter, Vol. 1 no. 3 (January 1984).

    Google Scholar 

  10. D. A. Turner, SASL language manual, (1976)

    Google Scholar 

  11. D. A. Turner, "Recursion Equations as a Programming Language", pp 1–10 in Functional Programming and its applications, Cambridge Press 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Methodology Group Department of Computer Science, Chalmers University of Technology, S-412 96, Göteborg, Sweden

    Lennart Augustsson

Authors
  1. Lennart Augustsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Pierre Jouannaud

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Augustsson, L. (1985). Compiling pattern matching. In: Jouannaud, JP. (eds) Functional Programming Languages and Computer Architecture. FPCA 1985. Lecture Notes in Computer Science, vol 201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15975-4_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-15975-4_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15975-9

  • Online ISBN: 978-3-540-39677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation