Skip to main content

Type specialisation for the λ-calculus; or, a new paradigm for partial evaluation based on type inference

  • Conference paper
  • First Online:
Partial Evaluation

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anders Bondorf. Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17(l–3):3–34, December 1991. Selected papers of ESOP '90, the 3rd European Symposium on Programming.

    Google Scholar 

  2. Anders Bondorf. Improving binding times without explicit cps-conversion. In 1992 ACM Conference on Lisp and Functional Programming. San Francisco, California, pages 1–10, June 1992.

    Google Scholar 

  3. Charles Consel and Olivier Danvy. For a Better Support of Static Data Flow. In John Hughes, editor, Functional Programming and Computer Architecture, LNCS, pages 496–519. Springer-Verlag, 1991.

    Google Scholar 

  4. Olivier Danvy. Type-directed partial evaluation. In Symposium on Principles of Programming Languages. ACM, jan 1996.

    Google Scholar 

  5. Dirk Dussart, Eddy Bevers, and Karel De Vlaminck. Polyvariant Constructor Specialisation. In Proc. ACM Conference on Partial Evaluation and Program Manipulation, La Jolla, California, 1995.

    Google Scholar 

  6. C. K. Gomard and N. D. Jones. A partial evaluator for the untyped lambda-calculus. Journal of Functional Programming, 1(1):21–70, January 1991.

    Google Scholar 

  7. Fritz Henglein. Efficient type inference for higher-order binding-time analysis. In J. Hughes, editor, FPCA, pages 448–472. 5th ACM Conference, Cambridge, MA, USA, Springer-Verlag, August 1991. Lecture Notes in Computer Science, Vol. 523.

    Google Scholar 

  8. J. Launchbury. Projection Factorisations in Partial Evaluation (PhD thesis), volume 1 of Distinguished Dissertations in Computer Science. Cambridge University Press, 1991.

    Google Scholar 

  9. Torben Æ. Mogensen. Constructor specialization. In David Schmidt, editor, ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 22–32, June 1993.

    Google Scholar 

  10. F. Nielson and H. R. Nielson. Two-Level Functional Languages. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.

    Google Scholar 

  11. S. A. Romanenko. Arity raiser and its use in program specialisation. In Proc. 3rd European Symposium on Programming, Lecture Notes in Computer Science Vol. 432, pages 341–360. Springer-Verlag, May 1990.

    Google Scholar 

  12. P. Wadler. The essence of functional programming. In Proceedings 1992 Symposium on principles of Programming Languages, pages 1–14, Albuquerque, New Mexico, 1992.

    Google Scholar 

  13. Daniel Weise and Erik Ruf. Computing types during program specialization. Technical Report CSL-TR-90-441, Stanford Computer Science Laboratory, October 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Olivier Danvy Robert Glück Peter Thiemann

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hughes, J. (1996). Type specialisation for the λ-calculus; or, a new paradigm for partial evaluation based on type inference. In: Danvy, O., Glück, R., Thiemann, P. (eds) Partial Evaluation. Lecture Notes in Computer Science, vol 1110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61580-6_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-61580-6_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61580-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics