Control-flow analysis of functional programs
- 14 June 2012
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 44 (3), 1-33
- https://doi.org/10.1145/2187671.2187672
Abstract
We present a survey of control-flow analysis of functional programs, which has been the subject of extensive investigation throughout the past 30 years. Analyses of the control flow of functional programs have been formulated in multiple settings and have led to many different approximations, starting with the seminal works of Jones, Shivers, and Sestoft. In this article, we survey control-flow analysis of functional programs by structuring the multitude of formulations and approximations and comparing them.Keywords
This publication has 100 references indexed in Scilit:
- CPS transformation of flow information, Part II: administrative reductionsJournal of Functional Programming, 2003
- CPS transformation of flow informationJournal of Functional Programming, 2003
- Syntactic accidents in program analysis: on the impact of the CPS transformationJournal of Functional Programming, 2003
- Stackability in the simply-typed call-by-value lambda calculusScience of Computer Programming, 1998
- Closure analysis in constraint formACM Transactions on Programming Languages and Systems, 1995
- Efficient analyses for realistic off-line partial evaluationJournal of Functional Programming, 1993
- Collecting interpretations of expressionsACM Transactions on Programming Languages and Systems, 1991
- The interprocedural analysis and automatic parallelization of Scheme programsHigher-Order and Symbolic Computation, 1989
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978
- Optimization of very high level languages—I: Value transmission and its corollariesComputer Languages, 1975