J. M. Ashley and R. K. Dybvig, A practical and flexible flow analysis for higher-order languages, ACM Transactions on Programming Languages and Systems, vol.20, issue.4, pp.845-868, 1998.
DOI : 10.1145/291891.291898

A. E. Ayers, Efficient closure analysis with reachability, Actes WSA'92 Workshop on Static Analysis, Bigre, pp.126-134, 1992.

S. K. Biswas, A demand-driven set-based analysis, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.372-385
DOI : 10.1145/263699.263753

D. Cachera, T. Jensen, D. Pichardie, and V. Rusu, Extracting a data flow analyser in constructive logic, Theoretical Computer Science, vol.342, issue.1, pp.56-78, 2005.
DOI : 10.1016/j.tcs.2005.06.004
URL : https://hal.archives-ouvertes.fr/inria-00564633

W. D. Clinger, Proper tail recursion and space efficiency, Proceedings of the ACM SIGPLAN 1998 Conference on Programming Languages Design and Implementation, pp.174-185, 1998.

C. Consel and O. Danvy, For a better support of static data flow, Proceedings of the Fifth ACM Conference on Functional Programming and Computer Architecture, pp.496-519, 1991.
DOI : 10.1007/3540543961_24

P. Cousot, The calculational design of a generic abstract interpreter, Calculational System Design. NATO ASI Series F. IOS Press, 1999.

P. Cousot, Semantic foundations of program analysis, Program Flow Analysis: Theory and Applications, pp.303-342, 1981.

P. Cousot and R. Cousot, Abstract interpretation of algebraic polynomial systems (Extended abstract), Proceedings of the Sixth International Conference on Algebraic Methodology and Software Technology, AMAST '97, pp.138-154, 1997.
DOI : 10.1007/BFb0000468

P. Cousot and R. Cousot, Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper, Proceedings of the Fifth IEEE International Conference on Computer Languages, pp.95-112, 1994.

P. Cousot and R. Cousot, Abstract Interpretation Frameworks, Journal of Logic and Computation, vol.2, issue.4, pp.511-547, 1992.
DOI : 10.1093/logcom/2.4.511

P. Cousot and R. Cousot, Abstract interpretation and application to logic programs, The Journal of Logic Programming, vol.13, issue.2-3, pp.103-179, 1992.
DOI : 10.1016/0743-1066(92)90030-7
URL : http://doi.org/10.1016/0743-1066(92)90030-7

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590

P. Cousot and R. Cousot, Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '79, pp.269-282, 1979.
DOI : 10.1145/567752.567778

D. Damian and O. Danvy, Syntactic accidents in program analysis: on the impact of the CPS transformation, ACM SIGPLAN International Conference on Functional Programming, pp.867-904, 2000.
DOI : 10.1017/S0956796802004379

O. Danvy, Three steps for the CPS transformation, 1991.

O. Danvy, Back to direct style, A preliminary version was presented at the Fourth European Symposium on Programming, pp.183-195, 1992.
DOI : 10.1016/0167-6423(94)00003-4

B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, 2002.
DOI : 10.1017/CBO9780511809088

S. K. Debray and T. A. Proebsting, Interprocedural control flow analysis of first-order programs with tail-call optimization, ACM Transactions on Programming Languages and Systems, vol.19, issue.4, pp.568-585, 1997.
DOI : 10.1145/262004.262006

C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen, The essence of compiling with continuations, Proceedings of the ACM SIGPLAN 1993 Conference on Programming Languages Design and Implementation, pp.237-247, 1993.

M. Fluet and S. Weeks, Contification using dominators, Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP'01), pp.2-13, 2001.

K. L. Gasser, F. Nielson, and H. R. Nielson, Systematic realisation of control flow analyses for CML, Proceedings of the Second ACM SIGPLAN International Conference on Functional Programming, pp.38-51, 1997.

R. Giacobazzi, F. Ranzato, and F. Scozzari, Making abstract interpretations complete, Journal of the ACM, vol.47, issue.2, pp.361-416, 2000.
DOI : 10.1145/333979.333989

N. Heintze, Set-based analysis of ML programs, Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, pp.306-317, 1994.
DOI : 10.1145/182590.182495

I. N. Jones, Flow analysis of lambda expressions, Automata, Languages and Programming, 8th Colloquium, pp.114-128, 1981.
DOI : 10.1007/3-540-10843-2_10

A. Kennedy, Compiling with continuations, continued, Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming (ICFP'07), pp.177-190, 2007.

P. J. Landin, The Mechanical Evaluation of Expressions, The Computer Journal, vol.6, issue.4, pp.308-320, 1964.
DOI : 10.1093/comjnl/6.4.308

J. Midtgaard, Control-flow analysis of functional programs, 2007.

J. Midtgaard and T. Jensen, A Calculational Approach to Control-Flow Analysis by Abstract Interpretation, Static Analysis , 15th International Symposium, SAS 2008, pp.347-362, 2008.
DOI : 10.1007/978-3-540-69166-2_23

M. Might and O. Shivers, Environmental analysis via ?CFA, Proceedings of the 33rd Annual ACM Symposium on Principles of Programming Languages, pp.127-140, 2006.

R. Milner and M. Tofte, Co-induction in relational semantics, Theoretical Computer Science, vol.87, issue.1, pp.209-220, 1991.
DOI : 10.1016/0304-3975(91)90033-X

F. Nielson and H. R. Nielson, Infinitary control flow analysis, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.332-345
DOI : 10.1145/263699.263745

F. Nielson, H. R. Nielson, and C. Hankin, Principles of Program Analysis, 1999.
DOI : 10.1007/978-3-662-03811-6

H. R. Nielson and F. Nielson, Flow Logic: A Multi-paradigmatic Approach to Static Analysis, Lecture Notes in Computer Science, vol.2566, pp.223-244, 2002.
DOI : 10.1007/3-540-36377-7_11

J. Palsberg, Closure analysis in constraint form, ACM Transactions on Programming Languages and Systems, vol.17, issue.1, pp.47-62, 1995.
DOI : 10.1145/200994.201001

J. Palsberg and M. I. Schwartzbach, Safety Analysis versus Type Inference, Information and Computation, vol.118, issue.1, pp.128-141, 1995.
DOI : 10.1006/inco.1995.1058
URL : http://doi.org/10.1006/inco.1995.1058

J. Palsberg and M. Wand, CPS transformation of flow information, Journal of Functional Programming, vol.13, issue.5, pp.905-923, 2003.
DOI : 10.1017/S0956796802004513

D. Pichardie, Interprétation abstraite en logique intuitioniste: extraction d'analyseurs Java certifiés, 2005.

J. C. Reynolds, Definitional interpreters for higher-order programming languages . Higher-Order and Symbolic Computation, Reprinted from the proceedings of the 25th ACM National Conference, pp.363-397, 1972.

A. Sabry and M. Felleisen, Is continuation-passing useful for data flow analysis?, Proceedings of the ACM SIGPLAN 1994 Conference on Programming Languages Design and Implementation, pp.1-12, 1994.

P. Sestoft, Replacing function parameters by global variables, Proceedings of the fourth international conference on Functional programming languages and computer architecture , FPCA '89, pp.39-53, 1989.
DOI : 10.1145/99370.99374

O. Shivers, Control-flow analysis in Scheme, Proceedings of the ACM SIGPLAN 1988 Conference on Programming Languages Design and Implementation, pp.164-174, 1988.

F. Spoto and T. P. Jensen, Class analyses as abstract interpretations of trace semantics, ACM Transactions on Programming Languages and Systems, vol.25, issue.5, pp.578-630, 2003.
DOI : 10.1145/937563.937565

P. A. Steckler and M. Wand, Lightweight closure conversion, ACM Transactions on Programming Languages and Systems, vol.19, issue.1, pp.48-86, 1997.
DOI : 10.1145/239912.239915
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.1094