Syntactic accidents in program analysis: On the impact of the CPS transformation

Journal of Functional Programming

Volumn 13, Issue 5, 2003, Pages 867-904

  Damian, Daniel ^a   Danvy, Olivier ^b  

^a UK   (United Kingdom)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM ANALYSIS;

COMPUTER PROGRAM LISTINGS; SYNTACTICS; THEOREM PROVING;

MATHEMATICAL PROGRAMMING;

EID: 0042411225     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796802004379     Document Type: Article

References (45)

1. Abadi, M., Banerjee, A., Heintze, N. and Riecke, J. G. (1999) A core calculus of dependency. In: Aiken, A., editor, Proceedings 26th Annual ACM Symposium on Principles of Programming Languages, pp. 147-160. ACM Press.
2. Benton, N. and Wadler, P. (1996) Linear logic, monads and the lambda calculus. In: Clarke, E. M., editor, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp. 420-431. IEEE Press.
3. Bondorf, A. (1992) Improving binding times without explicit cps-conversion. In: Clinger, W., editor, Proceedings 1992 ACM Conference on Lisp and Functional Programming, ACM Press. (LISP Pointers, V(1): 1-10.)
4. Consel, C. and Danvy, O. (1991a) For a better support of static data flow. In: Hughes, J., editor, Proceedings 5th ACM Conference on Functional Programming and Computer Architecture: Lecture Notes in Computer Science 523, pp. 496-519. Springer-Verlag.
5. Consel, C. and Danvy, O. (1991b) Static and dynamic semantics processing. In: Cartwright, R. C., editor, Proceedings 18th Annual ACM Symposium on Principles of Programming Languages, pp. 14-24. ACM Press.
6. Consel, C. and Danvy, O. (1993) Tutorial notes on partial evaluation. In: Graham, S. L., editor, Proceedings 20th Annual ACM Symposium on Principles of Programming Languages, pp. 493-501. ACM Press.
7. Cousot, P. and Cousot, R. (1995) Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In: Peyton Jones, S., editor, Proceedings 17th ACM Conference on Functional Programming and Computer Architecture, pp. 170-181. ACM Press.
8. Damian, D. (2001) On Static and Dynamic Control-Flow Information in Program Analysis and Transformation. PhD thesis, BRICS PhD School, University of Aarhus, Aarhus, Denmark.
9. Damian, D. and Danvy, O. (2001a) CPS Transformation of Flow Information, Part II: Administrative Reductions. Technical Report BRICS RS-01-40. DAIMI, Department of Computer Science, University of Aarhus, Denmark, to appear in J. Functional Programming.
10. Damian, D. and Danvy, O. (2001b) A simple CPS Transformation of Control-Flow Information. Technical Report BRICS RS-01-55. DAIMI, Department of Computer Science, University of Aarhus, Denmark.
11. Danvy, O. (1991) Semantics-directed compilation of non-linear patterns. Infor. Process. Lett. 37(6): 315-322.
12. Danvy, O. and Filinski, A. (1990) Abstracting control. In: Wand, M., editor, Proceedings 1990 ACM Conference on Lisp and Functional Programming, pp. 151-160. ACM Press.
13. Danvy, O. and Nielsen, L. R. (2002) A first-order one-pass CPS transformation. In: Nielsen, M. and Engberg, V. editors, Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Lecture Notes in Computer Science. Springer-Verlag. (Extended version available as the technical report BRICS RS-01-49.)
14. Gasser, K. L. S., Nielson, F. and Nielson, H. R. (1997) Systematic realisation of control flow analyses for CML. In: Tofte, M., editor, Proceedings 1997 ACM SIGPLAN International Conference on Functional Programming, pp. 38-51. ACM Press.
15. Hatcliff, J. and Danvy, O. (1994) A generic account of continuation-passing styles. In: Boehm, H.-J., editor, Proceedings 21st Annual ACM Symposium on Principles of Programming Languages, pp. 458-471. ACM Press.
16. Hatcliff, J. and Danvy, O. (1997) A computational formalization for partial evaluation. Mathematical Structures in Computer Science, pp. 507-541. (Extended version available as the technical report BRICS RS-96-34.)
17. Heintze, N. (1994) Set-based program analysis of ML programs. In: Talcott, C. L., editor, Proceedings 1994 ACM Conference on Lisp and Functional Programming. ACM Press. (LISP Pointers, VII(3).)
18. Henglein, F. (1996) Syntactic Properties of Polymorphic Subtyping. Technical report, Semantics Report D-293. DIKU, Computer Science, Department, University of Copenhagen.
19. Holst, C. K. and Gomard, C. K. (1991) Partial evaluation is fuller laziness. In: Hudak, P. and Jones, N. D., editors, Proceedings ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM Press. (SIGPLAN Notices, 26(9): 223-233.)
20. Jagannathan, S. and Weeks, S. (1995) A unified treatment of flow analysis in higher-order languages. In: Lee, P., editor, Proceedings 22nd Annual ACM Symposium on Principles of Programming Languages, pp. 393-407. ACM Press.
21. Jones, N. D. (1996) What not to do when writing an interpreter for specialisation. In: Danvy, O., Glück, R. and Thiemann, P., editors, Partial Evaluation: Lecture Notes in Computer Science 1110, pp. 216-237. Springer-Verlag.
22. Jones, N. D., Gomard, C. K. and Sestoft, P. (1993) Partial Evaluation and Automatic Program Generation. Prentice-Hall International. (Available online at http://www.dina.kvl.dk/̃sestoft/pebook/pebook.html.)
23. Jørring, U. and Scherlis, W. L. (1986) Compilers and staging transformations. In: Johnson, M. S. and Sethi, R., editors, Proceedings 13th Annual ACM Symposium on Principles of Programming Languages, pp. 86-96. ACM Press.
24. Kam, J. B. and Ullman, J. D. (1977) Monotone data flow analysis frameworks. Acta Informatica, 7: 305-317.
25. Lawall, J. L. and Danvy, O. (1994) Continuation-based partial evaluation. In: Talcott, C. L., editor, Proceedings 1994 ACM Conference on Lisp and Functional Programming. ACM Press. (LISP Pointers, VII(3).)
26. Meyer, A. R. and Wand, M. (1985) Continuation semantics in typed lambda-calculi (summary). In: Parikh, R., editor, Logics of Programs - Proceedings: Lecture Notes in Computer Science 193, pp. 219-224. Springer-Verlag.
27. Moggi, E. (1991) Notions of computation and monads. Information & Compulation, 93: 55-92.
28. Muylaert-Filho, J. A. and Burn, G. L. (1993) Continuation passing transformation and abstract interpretation. In: Burn, G. L., Gay, S. J. and Ryan, M. D., editors, Theory and Formal Methods 1993: Proceedings 1st Imperial College Department of Computing Workshop on Theory and Formal Methods. Workshops in Computing Series, pp. 247-259. Springer-Verlag.
29. Nielson, F. (1982) A denotational framework for data flow analysis. Acta Informatica, 18: 265-287.
30. Nielson, F. and Nielson, H. R. (1992) Two-Level Functional Languages. Cambridge Tracts in Theoretical Computer Science, vol. 34. Cambridge University Press.
31. Nielson, F. and Nielson, H. R. (1997) Infinitary control flow analysis: a collecting semantics for closure analysis. In: Jones, N. D., editor, Proceedings 24th Annual ACM Symposium on Principles of Programming Languages, pp. 332-345. ACM Press.
32. Nielson, F., Nielson, H. R. and Hankin, C. (1999) Principles of Program Analysis. Springer-Verlag.
33. Palsberg, J. (1993) Correctness of binding-time analysis. J. Functional Programming, 3(3): 347-363.
34. Palsberg, J. (1995) Comparing flow-based binding-time analyses. In: Mosses, P., Nielsen, M. and Schwartzbach, M., editors, Proceedings TAPSOFT '95: Lecture Notes in Computer Science 915, pp. 561-574. Springer-Verlag.
35. Palsberg, J. and O'Keefe, P. (1995) A type system equivalent to flow analysis. ACM Trans. Programming Lang. & Syst. 17(4): 576-599.
36. Palsberg, J. and Schwartzbach, M. I. (1994) Binding-time analysis: Abstract interpretation versus type inference. In: Bal, H., editor, Proceedings 5th IEEE International Conference on Computer Languages, pp. 289-298. IEEE Press.
37. Palsberg, J. and Wand, M. (2002) CPS transformation of flow information. J. Functional Programming. To appear.
38. Plotkin, G. D. (1975) Call-by-name, call-by-value and the λ-calculus. Theor. Comput. Sci. 1: 125-159.
39. Sabry, A. and Felleisen, M. (1994) Is continuation-passing useful for data flow analysis? In: Sarkar, V., editor, Proceedings ACM SIGPLAN'94 Conference on Programming Languages Design and Implementation. ACM Press. (SIGPLAN Notices, 29(6): 1-12.)
40. Sabry, A. and Wadler, P. (1997) A reflection on call-by-value. ACM Trans. Programming Lang. & Syst. 19(6): 916-941.
41. Shivers, O. (1991) Control-Flow Analysis of Higher-Order Languages or Taming Lambda. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania. (Technical Report CMU-CS-91-145.)
42. Steele, G. L. (1978) RABBIT: A Compiler for SCHEME. Technical report AI-TR-474. AI Laboratory, Massachusetts Institute of Technology, Cambridge, MA.
43. Talcott, C. L. (ed). (1994) Proceedings 1994 ACM Conference on Lisp and Functional Programming. ACM Press. (LISP Pointers, VII(3).)
44. Tofte, M., Birkedal, L., Elsman, M., Hallenberg, N., Olesen, T. H., Sestoft, P. and Bertelsen, P. (1997) Programming with Regions in the ML Kit. DIKU Rapport 97/12. University of Copenhagen, Copenhagen, Denmark.
45. Wand, M. (1985) Embedding type structure in semantics. In: Deusen, M. S. V. and Galil, Z., editors, Proceedings 12th Annual ACM Symposium on Principles of Programming Languages, pp. 1-6. ACM Press.