Flow analysis of lambda expressions

Preliminary version
  • Neil D. Jones
Session 4: C. Boehm, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)

References

  1. Aho77.
    Aho, Alfred V., and Jeffrey D. Ullman, Principles of Compiler Design, Reading, MA: Addison-Wesley, 1977.Google Scholar
  2. Bjø78.
    Bjørner, Dines and Cliff B. Jones, The Vienna Development Method: The Meta-Language, Lecture Notes in Computer Science 61 (1978).Google Scholar
  3. Böh72.
    Böhm, Corrado and Mariangiola Dezani, "A CUCH-Machine: The automatic Treatment of Bound variables", Int. J. Comp. Info. Sci. vol. 1, no. 2 (1972), 171–291.Google Scholar
  4. Cou77a.
    Cousot, Patrick and Radhia Cousot, "Static Determination of Dynamic Properties of Recursive Procedures", IFIP Working Conf. on Prog. Concepts, St. Andrews, Canada, North-Holland (1978), 237–277.Google Scholar
  5. Cou77b.
    Cousot, Patrick and Radhis Cousot, "Abstract Interpretation. A Unified Lattice Model for Static Analysis of Programs by Construction of Approximation of Fixpoints", Conf. Rec. of 4th ACM Symp. on Principles of Programming Languages, Los Angeles, CA (January 1977).Google Scholar
  6. Cou79.
    Cousot, Patrick and Radhis Cousot, "Systematic Design of Program Analysis Frameworks", Conf. Rec. 6th ACM Symp. on Principles of Programming Languages, San Antonio, TX (January 1979), 269–282.Google Scholar
  7. Cur58.
    Curry, Haskell B. and R. Feys, Combinatory Logic vol. 1, North-Holland, Amsterdam (1958).Google Scholar
  8. Eng75.
    Engelfriet, Joost, "Tree Automata and Tree Grammars", DAIMI Report FN-10, Computer Science Department, Aarhus University (1975).Google Scholar
  9. Hec77.
    Hecht, Matthew S., Flow Analysis of Computer Programs. New York: Elsevier North-Holland, 1977.Google Scholar
  10. Jon81.
    Jones, Neil D., "Flow Analysis of Lambda Expressions", DAIMI PB-128, Technical Report, Aarhus University, Denmark (1981), 31 pp.Google Scholar
  11. JoM81.
    Jones, Neil D. and Steven S. Muchnick, "Flow Analysis and Optimization of LISP-like Structures", in Program Flow Analysis, S. S. Muchnick and N.D. Jones (eds.), Prentice-Hall (1981).Google Scholar
  12. JoS80.
    Jones, Neil D. and David A. Schmidt, "Compiler Generation from Denotational Semantics", in Semantics-Directed Compiler Generation, Lecture Notes in Computer Science 94 (1980), 70–93.Google Scholar
  13. Lan64.
    Landin, P.J., "The Mechanical Evaluation of Expressions", Computer Journal vol. 6, no. 4 (1964).Google Scholar
  14. Lev76.
    Levy, J.J., "An Algebraic Interpretation of the λβκ-calculus and an Application of a labelled λ-calculus", Theor. Comp. Sci. vol. 2 no. 1 (1976), 97–114.Google Scholar
  15. McC63.
    McCarthy, J., "Towards a Mathematical Science of Computation" in Information Processing, North-Holland (1963).Google Scholar
  16. McG70.
    McGowan, C., "The Correctness of a modified SECD Machine", Second ACM Symposium on Theory of Computation (1970).Google Scholar
  17. Myc80.
    Mycroft, Alan, "The Theory and Practice of Transforming Call-by-need into Call-by-value", Internl. Symp. on Programming, LNCS 83 (1980), 269–281.Google Scholar
  18. Ple81.
    Pleban, Uwe, "A Denotational Semantics Approach to Program Optimization", Ph.D. Dissertation, Univ. of Kansas, Lawrence, KS (1981).Google Scholar
  19. Plo75.
    Plotkin, Gordon D., "Call-by-Name, Call-by-Value and the Lambda Calculus", Theor. Comp. Sci. 1 (1975), 125–159.Google Scholar
  20. Rey72.
    Reynolds, John, "Definitional Interpreters for Higher-Order Programming Languages", Proc. ACM National Meeting (1972).Google Scholar
  21. Ros79.
    Rosen, Barry K., "Data Flow Analysis for Procedural Languages", J. ACM, 26, no. 2 (April 1979), 322–344.Google Scholar
  22. Sch80.
    Schmidt, D.A., "State Transition Machines for Lambda Calculus Machines", in Semantics-Directed Compiler Generation, Lecture Notes In Computer Science 94 (1980), 415–440.Google Scholar
  23. Sha805.
    Sharir, M., "Data Flow Analysis of Applicative Programs", Courant Inst. Tech. Rep. 80-42, Columbia Univ., New York (1980). Also these procls. Google Scholar
  24. ShP81.
    Sharir, M. and A. Pnueli, "Two Approaches to Interprocedural Data Flow Analysis", Program Flow Analysis, S.S. Muchnick and N.D. Jones eds., Prentice-Hall (1981).Google Scholar
  25. Sin72.
    Sintzoff, M., "Calculating Properties of Programs by Valuation on Specific Models", Proc. ACM Conf. on Proving Assertions About Programs, New Mexico (1972), 203–207.Google Scholar
  26. Ste75.
    Steele, G.L. Jr., "SCHEME: An Interpreter for the Extended Lambda Calculus", Al Memo 349 (Dec. 1975), Artificial Intel. Lab., MIT.Google Scholar
  27. Tha73.
    Thatcher, J.W., "Tree Automata: An Informal Survey", in Currents in the Theory of Computing, ed. A. Aho. Prentice-Hall, (1973), 143–172.Google Scholar
  28. Tur76.
    Turner, D.A., SASL Language Manual, U. of St. Andrews, Fife, Scotland (1976).Google Scholar
  29. Weg68.
    Wegner, P., Programming Languages, Information Structures and Machine Organization, McGraw-Hill, New York (1968).Google Scholar

Copyright information

© Springer-Verlag 1981

Authors and Affiliations

  • Neil D. Jones
    • 1
  1. 1.Aarhus UniversityDenmark

Personalised recommendations