Advertisement

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

  • John Hughes
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1110)

Keywords

Residual Program Free Variable Recursive Function Partial Evaluation Type Inference 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bon91]
    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. [Bon92]
    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. [CD91]
    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. [Dan96]
    Olivier Danvy. Type-directed partial evaluation. In Symposium on Principles of Programming Languages. ACM, jan 1996.Google Scholar
  5. [DBV95]
    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. [GJ91]
    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. [Hen91]
    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. [Lau91]
    J. Launchbury. Projection Factorisations in Partial Evaluation (PhD thesis), volume 1 of Distinguished Dissertations in Computer Science. Cambridge University Press, 1991.Google Scholar
  9. [Mog93]
    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. [NN92]
    F. Nielson and H. R. Nielson. Two-Level Functional Languages. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.Google Scholar
  11. [Rom90]
    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. [Wad92]
    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. [WR90]
    Daniel Weise and Erik Ruf. Computing types during program specialization. Technical Report CSL-TR-90-441, Stanford Computer Science Laboratory, October 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • John Hughes
    • 1
  1. 1.Department of Computer ScienceChalmers Technical UniversityGöteborgSweden

Personalised recommendations