论文信息 - Polyvariance, Polymorphism and Flow Analysis

Polyvariance, Polymorphism and Flow Analysis

Flow analysis is a potentially very useful analysis for higher order functional languages, but its practical application has been slow in coining, partially hindered by shortcomings of the current analysis techniques. Among these are the limited precision, long analysis times, incompatibility with separate compilation, inapplicability to untyped languages and sensitivity to program structure associated with various earlier formulations.

Karl-Filip Faxén

[1] Neil D. Jones,et al. Flow analysis and optimization of LISP-like structures , 1979, POPL.

[2] Nevin Heintze,et al. Set-based analysis of ML programs , 1994, LFP '94.

[3] Neil D. Jones,et al. A flexible approach to interprocedural data flow analysis and programs with recursive data structures , 1982, POPL '82.

[4] Olin Shivers,et al. Control flow analysis in scheme , 1988, PLDI '88.

[5] Olin Shivers,et al. The semantics of Scheme control-flow analysis , 1991, PEPM '91.

[6] Olin Shivers. The semantics of Scheme control-flow analysis , 1991 .

[7] Suresh Jagannathan,et al. Effective Flow Analysis for Avoiding Run-Time Checks , 1995, SAS.

[8] Jens Palsberg,et al. Closure analysis in constraint form , 1995, TOPL.

[9] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[10] Karl-Filip Faxén. Optimizing Lazy Functional Programs Using Flow Inference , 1995, SAS.

[11] Peter Sestoft,et al. Analysis and efficient implementation of functional programs , 1991 .

[12] Suresh Jagannathan,et al. A unified treatment of flow analysis in higher-order languages , 1995, POPL '95.