Effective flow analysis for avoiding run-time checks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 983, Issue , 1995, Pages 207-224

  Jagannathan, Suresh ^a   Wright, Andrew ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; STATIC ANALYSIS;

APPROXIMATION TECHNIQUES; CONSTANT FOLDING; DATA-FLOW INFORMATION; LOOP-INVARIANT CODE MOTION; POLYMORPHIC TYPES; PROGRAM ANALYSIS; PROGRAM OPTIMIZATION; TYPE INFERENCES;

DATA FLOW ANALYSIS;

EID: 84955580823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60360-3_41     Document Type: Conference Paper

References (23)

1. th ACM Symposium on Principles of Programming Languages, pages 163-173, 1994.
2. Henk Barendregt. The Lambda Calculus. North-Holland, Amsterdam, 1981.
3. 4 Report on the Algorithmic Language Scheme. ACM Lisp Pointers, 4(3), July 1991.
4. Kent Dybvig. The Scheme Programming Language. Prentice-Hall, Inc., 1987.
5. Marc Peeley, Marc Turcotte, and Guy Lapalme. Using MultiLisp for Solving Constraint Satistfaction Problems: An Application to Nucleic Acid 3D Structure Determination. Lisp and Symbolic Computation, 7(2/3):231-248, 1994.
6. Leslie Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. ACM Press, 1987.
7. Nevin Heintze. Set-Based Analysis of ML Programs. In Proceedings of the ACM Symposium on Lisp and Functional Programming, pages 306-317, 1994.
8. Fritz Henglein. Global Tagging Optimization by Type Inference. In Proceedings of the ACM Symposium on Lisp and Functional Programming, pages 205-215, 1992.
9. R. Hindley. The Principal Type-Scheme of an Object in Combinatory Logic. Transactions of the American Mathematical Society, 146:29-60, December 1969.
10. th ACM Symposium on Principles of Programming Languages, pages 392-401, January 1995.
11. th ACM Symposium on Principles of Programming Languages, pages 244-256, January 1979.
12. Robin Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences, 17:348-375, 1978.
13. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.
14. John Mitchell. Handbook of Theoretical Computer Science: Volume B, chapter Type Systems for Programming Languages, pages 367-453. MIT Press, 1990.
15. Jens Palsberg. Global Program Analysis in Constraint Form. In Proceedings of the 1994 Colloquium on Trees in Algebra and Programming, pages 276-290. Springer-Verlag, 1994. Appears as LNCS 787.
16. th ACM Symposium on Principles of Programming Languages, pages 367-378, January 1995.
17. Jens Palsberg and Michael Schwartzbach. Safety Analysis versus Type Inference. Information and Computation, to appear.
18. Gordon D. Plotkin. Call-by-name, call-by-value and the lambda-calculus. Theoretical Computer Science, 1:125-159, 1975.
19. Olin Shivers. Data-flow Analysis and Type Recovery in Scheme. In Topics in Advanced Language Implementation. MIT Press, 1990.
20. Olin Shivers. Control-Flow Analysis of Higher-Order Languages or Taming Lambda. PhD thesis, School of Computer Science, Carnegie-Mellon University, 1991.
21. Peter Steenkiste and John Hennessy. Tags and type checking in lisp. In Proceedings of the Second Architectural Support for Programming Languages and Systems Symposium, pages 50-59, 1987.
22. Andrew Wright and Robert Cartwright. A Practical Soft Type System for Scheme. In Proceedings of the ACM Symposium on Lisp and Functional Programming, pages 250-262, 1994.
23. Feng Zhao. An 0(N) Algorithm for Three-Dimensional N-Body Simulations. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1987.