Flow analysis and optimization of LISP-like structures

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1979, Pages 244-256

  Jones, Neil D ^a   Muchnick, Steven S ^a  

^a UNIVERSITY OF KANSAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; PROGRAM COMPILERS; PROGRAM INTERPRETERS; COMPUTER PROGRAMMING LANGUAGES - LISP;

ANALYTIC METHOD; BINDING TIME; DATA FLOW; DATA OBJECTS; FLOW ANALYSIS; PROGRAM POINTS;

LISP (PROGRAMMING LANGUAGE); COMPUTER METATHEORY;

EID: 0018295306     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/567752.567776     Document Type: Conference Paper

References (19)

1. Baker, Henry G., Jr., List Processing in Real Time on a Serial Computer, CACM, vol. 21, no. 4, 1978, pp. 280-294.
2. Barth, J. M., Shifting Garbage Collector Overhead to Compile Time, CACM, vol. 20, no. 7, 1977, pp. 513-519.
3. Brainerd, W. S., Tree Generating Regular Systems, Information and Control, vol. 14, 1969, pp. 217-231.
4. Büchi, J. R., Regular Canonical Systems, Archiv f. Math. Logik und Grand., vol. 6, 1964, pp. 91-111.
5. Clark, D. W. and C. C. Green, An Empirical Study of List Structure in LISP, CACM, vol. 20, no. 2, 1977, pp. 78-87.
6. Cousot, Patrick and Rhadia Cousot, Automatic Synthesis of Optimal Invariant Assertions: Mathematical Foundations, Proc. ACM Symp. on Artif. Intel. and Prog. Lang., SIGPLAN Notices, vol. 12, no. 8, August 1977, pp. 1-12.
7. Cousot, Patrick and Rhadia Cousot, Static Determination of Dynamic Properties of Generalized Type Unions, SIGPLAN Notices, vol. 12, no. 3, March 1977, pp. 77-94.
8. Engelfriet, J., Tree Automata and Tree Grammars, DAIMI Report FN-10, Department of Computer Science, University of Aarhus, Denmark, 1975.
9. Ginsburg, Seymour, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.
10. Goto, E., Monocopy and Associative Algorithms in an Extended LISP, University of Tokyo, Japan, May 1974.
11. Hoare, C. A. R., Recursive Data Structures, Inter. J. Camp, and Sys. Sci., vol. 4, no. 2, 1975, pp. 105-132.
12. Jones, N. D. and S. S. Muchnick, Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language, Proc. 3rd ACM SIGACT - SIGPLAN Symp. on Princ. of Prog. Lang. January 1976, pp. 77-94.
13. Kaplan, Marc, Relational Data Flow Analysis, Technical Report 243, Dept. of Elec. Eng. and Comp. Sci., Princeton University, April 1978 (revised).
14. Kaplan, Marc and J. D. Ullman, A General Scheme for the Automatic Inference of Variable Types, Conf. Record of 5th ACM Symp. on Princ. of Prog. Lang., Tucson, AZ, January 1978, pp. 60-75.
15. Milne, Robert and Christopher Strachey, A Theory of Programming Language Semantics, Chapman and Hall, London; Halsted Press, John Wiley, New York, 1976.
16. Reynolds, John C, Automatic Computation of Data Set Definitions, Proc. of IFTP Congress 68, August 1968, pp. B69 - B73.
17. Schwartz, J. T., Optimization of Very High Level Languages - I: Value Transmission and Its Corollaries, Computer Languages, vol. 1, 1975, pp. 161-194.
18. Stoy, Joseph E., Denotational Semantics: The Saott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge, MA, 1977.
19. Thatcher, J., Tree Automata: An Informal Survey, in Aho, Alfred (ed.), Currents in the Theory of Computing, Prentice-Hall, 1973, pp. 143-172.