Cybernetics and Systems Analysis

, Volume 33, Issue 1, pp 114–130 | Cite as

The development of a partial evaluator for extended lambda calculus

  • A. A. Letichevsky
Systems Analysis
Received:
  • 17 Downloads

Keywords

Normal Form Operational Semantic Partial Evaluation Denotational Semantic Ground Term 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Neil D. Jones, Carsten Gomard, and Peter Sestoft, Partial Evaluation and Automatic Program Generation, C. A. R. Hoare (ed.), International Series in Computer Science, Prentice Hall International (June 1993).Google Scholar
  2. 2.
    C. K. Gomard, "A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics," ACM Trans. Prog. Lang. Syst.,14, No. 2, 147–172 (Apr. 1992).CrossRefGoogle Scholar
  3. 3.
    C. K. Gomard and N. D. Jones, "A partial evaluator for the untyped lambda-calculus," J. Funct. Programming,1(1), 21–69 (Jan. 1991).MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    S. L. Peyton Jones, The Implementation of Functional Languages, Prentice-Hall (1986).Google Scholar
  5. 5.
    G. Huet and J. J. Levy, "Computations in nonambiguous linear term rewriting systems," Technical Report 359, INRIA, Le Chesnay, France (1979).Google Scholar
  6. 6.
    A. A. Letichevsky, J. V. Kapitonova, and S. V. Konozenko, "Computations in APS," Theoret. Computer Sei.,119, 145–171 (1993).CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    H. P. Barendregt, The Lambda Calculus, North-Holland (1981).Google Scholar
  8. 8.
    T. Mogensen, "Self-applicable online partial evaluation of pure lambda calculus," Proc. of PEPM'95, ACM Press (1995), pp. 39–44.Google Scholar
  9. 9.
    Neil D. Jones, "MIX ten years after," Proc. of PEPM'95, ACM Press (1995), pp. 24–38.Google Scholar
  10. 10.
    T. Mogensen, "Efficient self-interpretation in lambda-calculus," J. Funct. Programming, Cambridge University Press,2(3), 345–364 (July 1992).Google Scholar
  11. 11.
    E. Ruf and D. Weise, "On the specialization of online program specializes," J. Funct. Programming, Cambridge University Press,3(3), 251–280 (July 1993).Google Scholar
  12. 12.
    D. Weise, R. Coneybeare, E. Ruf, and S. Seligman, "Automatic online program specialization," Functional Programming and Computer Architecture, August 1991, Springer Verlag LNCS 523 (1991), pp. 165–191.Google Scholar
  13. 13.
    H. P. Barendregt, "Self-interpretation in the lambda calculus," J. Funct. Programming, Cambridge University Press,2(1) (April 1991).Google Scholar
  14. 14.
    R. C. Sekar and I. V. Ramakrishnan, "Programming in equational logic: Beyond strong sequentiality," in: Proc. 5th Annual IEEE Symp. on Logic in Computer Sci, IEEE Comp. Soc. Press (June 1990), pp. 230–241.Google Scholar
  15. 15.
    A. A. Letichevsky, "Development of rewriting strategies," in: Proc. PLILP'93, LNCS, Vol. 714, Springer-Verlag (1993).Google Scholar

Copyright information

© Plenum Publishing Corporation 1997

Authors and Affiliations

  • A. A. Letichevsky

There are no affiliations available

Personalised recommendations