Equality-based flow analysis versus recursive types

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 6, 1998, Pages 1251-1264

  Palsberg, Jens ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROGRAMMING THEORY; RECURSIVE FUNCTIONS; TREES (MATHEMATICS);

EQUALITY-BASED CONTROL-FLOW ANALYSIS;

DATA FLOW ANALYSIS;

EID: 0032269062     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/295656.295662     Document Type: Article

References (17)

1. AMADIO, R. M. AND CARDELLI, L. 1993. Subtyping recursive types. ACM Trans. Program. Lang. Syst. 15, 4, 575-631.
2. ASHLEY, J. M. 1996. A practical and flexible flow analysis for higher-order languages. In Proceedings of POPL'96, 23rd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 184-194.
3. BONDORF, A. AND JØRGENSEN, J. 1993. Efficient analyses for realistic off-line partial evaluation. J. of Func. Program. 3, 3, 315-346.
4. BRUCE, K. B., CARDELLI, L., CASTAGNA, G., EIFRIG, J., SMITH, S. F., TRIFONOV, V., LEAVENS, G. T., AND PIERCE, B. C. 1995. On binary methods. Theory Pract. Obj. Syst. 1, 3, 221-242.
5. DEFOUW, G., GROVE, D., AND CHAMBERS, C. 1998. Fast interprocedural class analysis. In Proceedings of POPL'98, 25th Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 222-236.
6. GOSLING, J., JOY, B., AND STEELE, G. 1996. The Java Language Specification. Addison-Wesley, Reading, Mass.
7. HEINTZE, N. 1995. Control-flow analysis and type systems. In Proceedings of SAS'95, International Static Analysis Symposium. Lecture Notes in Computer Science, vol. 983. Springer-Verlag, Berlin, 189-206.
8. HEINTZE, N. AND MCALLESTER, D. 1997. Linear-time subtransitive control flow analysis. In Proceedings of ACM SIGPLAN 1997 Conference on Programming Language Design and Implementation. ACM, New York, 261-272.
9. HENGLEIN, F. 1992. Dynamic typing. In Proceedings of ESOP'92, European Symposium on Programming. Lecture Notes in Computer Science, vol. 582. Springer-Verlag, Berlin, 233-253.
10. MILNER, R., TOFTE, M., AND HARPER, R. 1990. The Definition of Standard ML. MIT Press, Cambridge, Mass.
11. PALSBERG, J. 1995. Closure analysis in constraint form. ACM Trans. Program. Lang. Syst. 17, 1 (Jan.), 47-62.
12. PALSBERG, J. AND O'KEEFE, P. M. 1995. A type system equivalent to flow analysis. ACM Trans. Program. Lang. Syst. 17, 4 (July), 576-599.
13. PALSBERG, J. AND PAVLOPOULOU, C. 1998. From polyvariant flow information to intersection and union types. In Proceedings of POPL'98, 25th Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 197-208.
14. PALSBERG J. AND SCHWARTZBACH, M. I. 1994. Object-Oriented Type Systems. John Wiley & Sons, New York.
15. SHAPIRO, M. AND HORWITZ, S. 1997. Fast and accurate flow-insensitive points-to analysis. In Proceedings of POPL'97, 24th Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 1-14.
16. SHIVERS, O. 1991. Control-flow analysis of higher-order languages. Ph.D. thesis, CMU-CS-91-145, Carnegie Mellon Univ., Pittsburgh, Pa.
17. STEENSGAARD, B. 1996. Points-to analysis in almost linear time. In Proceedings of POPL'96, 23nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 32-41.