Chapter PDF
Keywords
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.
References
Aho, Alfred V., and Jeffrey D. Ullman, Principles of Compiler Design, Reading, MA: Addison-Wesley, 1977.
Bjørner, Dines and Cliff B. Jones, The Vienna Development Method: The Meta-Language, Lecture Notes in Computer Science 61 (1978).
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.
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.
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).
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.
Curry, Haskell B. and R. Feys, Combinatory Logic vol. 1, North-Holland, Amsterdam (1958).
Engelfriet, Joost, "Tree Automata and Tree Grammars", DAIMI Report FN-10, Computer Science Department, Aarhus University (1975).
Hecht, Matthew S., Flow Analysis of Computer Programs. New York: Elsevier North-Holland, 1977.
Jones, Neil D., "Flow Analysis of Lambda Expressions", DAIMI PB-128, Technical Report, Aarhus University, Denmark (1981), 31 pp.
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).
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.
Landin, P.J., "The Mechanical Evaluation of Expressions", Computer Journal vol. 6, no. 4 (1964).
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.
McCarthy, J., "Towards a Mathematical Science of Computation" in Information Processing, North-Holland (1963).
McGowan, C., "The Correctness of a modified SECD Machine", Second ACM Symposium on Theory of Computation (1970).
Mycroft, Alan, "The Theory and Practice of Transforming Call-by-need into Call-by-value", Internl. Symp. on Programming, LNCS 83 (1980), 269–281.
Pleban, Uwe, "A Denotational Semantics Approach to Program Optimization", Ph.D. Dissertation, Univ. of Kansas, Lawrence, KS (1981).
Plotkin, Gordon D., "Call-by-Name, Call-by-Value and the Lambda Calculus", Theor. Comp. Sci. 1 (1975), 125–159.
Reynolds, John, "Definitional Interpreters for Higher-Order Programming Languages", Proc. ACM National Meeting (1972).
Rosen, Barry K., "Data Flow Analysis for Procedural Languages", J. ACM, 26, no. 2 (April 1979), 322–344.
Schmidt, D.A., "State Transition Machines for Lambda Calculus Machines", in Semantics-Directed Compiler Generation, Lecture Notes In Computer Science 94 (1980), 415–440.
Sharir, M., "Data Flow Analysis of Applicative Programs", Courant Inst. Tech. Rep. 80-42, Columbia Univ., New York (1980). Also these procls.
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).
Sintzoff, M., "Calculating Properties of Programs by Valuation on Specific Models", Proc. ACM Conf. on Proving Assertions About Programs, New Mexico (1972), 203–207.
Steele, G.L. Jr., "SCHEME: An Interpreter for the Extended Lambda Calculus", Al Memo 349 (Dec. 1975), Artificial Intel. Lab., MIT.
Thatcher, J.W., "Tree Automata: An Informal Survey", in Currents in the Theory of Computing, ed. A. Aho. Prentice-Hall, (1973), 143–172.
Turner, D.A., SASL Language Manual, U. of St. Andrews, Fife, Scotland (1976).
Wegner, P., Programming Languages, Information Structures and Machine Organization, McGraw-Hill, New York (1968).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jones, N.D. (1981). Flow analysis of lambda expressions. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive