Refunctionalization at work

Science of Computer Programming

Volumn 74, Issue 8, 2009, Pages 534-549

  Danvy, Olivier ^a   Millikin, Kevin ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Abstract machines; Continuation passing style (CPS); Continuations; Defunctionalization; Refunctionalization; Shunting yard algorithm

Indexed keywords

ABSTRACT MACHINES; CONTINUATION-PASSING STYLE (CPS); CONTINUATIONS; DEFUNCTIONALIZATION; REFUNCTIONALIZATION; SHUNTING-YARD ALGORITHM;

ABSTRACTING;

EID: 67349225441     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2007.10.007     Document Type: Article

References (71)

1. M.S. Ager, Partial evaluation of string matchers & constructions of abstract machines, Ph.D. Thesis, BRICS, University of Aarhus, 2006
2. Ager M.S., Biernacki D., Danvy O., and Midtgaard J. A functional correspondence between evaluators and abstract machines. Proc. of 5th Int. ACM-SIGPLAN Conf. on Principles and Practice of Declarative Programming. PPDP 2003, Uppsala, Aug. 2003 (2003), ACM Press, New York 8-19
3. Ager M.S., Danvy O., and Midtgaard J. A functional correspondence between call-by-n~eed evaluators and lazy abstract machines. Inform. Process. Lett. 90 5 (2004) 223-232 Extended version available as Research Report BRICS RS-04-3
4. Ager M.S., Danvy O., and Midtgaard J. A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. Theoret. Comput. Sci. 342 1 (2005) 149-172 Extended version available as Research Report BRICS RS-04-28
5. Banerjee A., Heintze N., and Riecke J.G. Design and correctness of program transformations based on control-flow analysis. In: Kobayashi N., and Pierce B.C. (Eds). Proc. of 4th Int. Symp. on Theoretical Aspects of Computer Software. TACS 2001, Sendai, Oct. 2001. Lect. Notes in Comput. Sci. vol. 2215 (2001), Springer, Berlin 420-447
6. Bell J.M., Bellegarde F., and Hook J. Type-driven defunctionalization. Proc. of 2nd ACM SIGPLAN Int. Conf. on Functional Programming. ICFP '97, Amsterdam, June 1997 (1997), ACM Press, New York 25-37 (= ACM SIGPLAN Notices 32~(8))
7. Biernacka M., Biernacki D., and Danvy O. An operational foundation for delimited continuations in the CPS hierarchy. Logical Methods Comput. Sci. 1 2 (2005) article 5
8. Biernacka M., and Danvy O. A concrete framework for environment machines. ACM Trans. Comput. Logic 9 1 (2007) article 6
9. Biernacka M., and Danvy O. A syntactic correspondence between context-sensitive calculi and abstract machines. Theoret. Comput. Sci. 375 1-3 (2007) 76-108 Extended version available as Research Report BRICS RS-06-18
10. D. Biernacki, The theory and practice of programming languages with delimited continuations, Ph.D. Thesis, BRICS, University of Aarhus, 2005
11. Biernacki D., and Danvy O. From interpreter to logic engine by defunctionalization. In: Bruynooghe M. (Ed). Revised Selected Papers from 13th Int. Symp. on Logic-Based Program Synthesis and Transformation. LOPSTR 2003, Uppsala, Aug. 2003. Lect. Notes in Comput. Sci. vol. 3018 (2004), Springer, Berlin 143-159
12. D. Biernacki, O. Danvy, K. Millikin, A dynamic continuation-passing style for dynamic delimited continuations, ACM Trans. Program. Lang. Syst. (accepted)
13. Biernacki D., Danvy O., and Shan C. On the static and dynamic extents of delimited continuations. Sci. Comput. Program. 60 3 (2006) 274-297
14. A. Bondorf, Self-applicable partial evaluation, Ph.D. Thesis, DIKU Rapport 90/17, Computer Science Dept. University of Copenhagen, 1990
15. U. Boquist, Code optimization techniques for lazy functional languages, Ph.D. Thesis, Dept. of Computing Science, Chalmers University of Technology and Göteborg University, 1999
16. Burge W.H. Recursive Programming Techniques (1975), Addison-Wesley, Reading, MA
17. Cejtin H., Jagannathan S., and Weeks S. Flow-directed closure conversion for typed languages. In: Smolka G. (Ed). Proc. of 9th Europ. Symp. on Programming. ESOP 2000, Berlin, March/Apr. 2000. Lect. Notes in Comput. Sci. vol. 1782 (2000), Springer, Berlin 56-71
18. Clements J., and Felleisen M. A tail-recursive semantics for stack inspection. ACM Trans. Program. Lang. Syst. 26 6 (2004) 1029-1052
19. Clinger W., Friedman D.P., and Wand M. A scheme for a higher-level semantic algebra. In: Nivat M., and Reynolds J.C. (Eds). Algebraic Methods in Semantics (1985), Cambridge University Press, Cambridge 237-250
20. Consel C. A tour of Schism: A partial evaluation system for higher-order applicative languages. Proc. of 1993 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation. PEPM '93, Copenhagen, June 1993 (1993), ACM Press, New York 145-154
21. Crégut P. Strongly reducing variants of the Krivine abstract machine. Higher-Order Symb. Comput. 20 3 (2007) 209-230 Revision of a paper that originally appeared in Proc. of 1990 ACM Conf. on Lisp and Functional Programming, LFP~'90 (Nice, June 1990) (ACM Press, New York, 1990) 333-340
22. Curien P.-L. Categorical Combinators, Sequential Algorithms and Functional Programming. 2nd ed. Progress in Theoretical Computer Science (1993), Birkhäuser, Boston
23. Danvy O. Back to direct style. Sci. Comput. Program. 22 3 (1994) 183-195
24. Danvy O. A rational deconstruction of Landin's SECD machine. In: Grelck C., Huch F., Michaelson G.J., and Trinder P. (Eds). Revised Selected Papers from 16th Int. Wksh. on Implementation and Application of Functional Languages. IFL '04, Lübeck, Sept. 2004. Lect. Notes in Comput. Sci. vol. 3474 (2005), Springer, Berlin 52-71 Extended version available as Research Report BRICS RS-03-33
25. O. Danvy, An analytical approach to program as data objects, DSc Thesis, Dept. of Computer Science, University of Aarhus, 2006
26. Danvy O., Dzafic B., and Pfenning F. On proving syntactic properties of CPS programs. In: Gordon A., and Pitts A. (Eds). Proc. of 3rd Int. Wksh. on Higher-Order Operational Techniques in Semantics. HOOTS '99, Paris, Sept./Oct. 1999. Electron. Notes in Theor. Comput. Sci. vol. 26 (1999), Elsevier, Amsterdam 21-33
27. Danvy O., and Filinski A. Abstracting control. Proc. of 1990 ACM Conf. on Lisp and Functional Programming. LFP '90, Nice, June 1990 (1990), ACM Press, New York 151-160
28. Danvy O., and Filinski A. Representing control, a study of the CPS transformation. Math. Struct. Comput. Sci. 2 4 (1992) 361-391
29. Danvy O., and Goldberg M. There and back again. Fund. Inform. 66 4 (2005) 397-413
30. Danvy O., and Lawall J.L. Back to direct style II: First-class continuations. Proc. of 1992 ACM Conf. on Lisp and Functional Programming, San Francisco, CA, June 1992 (1992), ACM Press, New York 299-310 (= LISP Pointers 5(1))
31. Danvy O., and Millikin K. A rational deconstruction of Landin's J operator. Logical Methods Comput. Sci. 4 4 (2008) article 12
32. Danvy O., and Nielsen L.R. Defunctionalization at work. Proc. of 3rd Int. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming. PPDP'01, Florence, Sept. 2001 (2001), ACM Press, New York 162-174 Extended version available as Research Report BRICS RS-01-23
33. Danvy O., and Nielsen L.R. Refocusing in reduction semantics, research report BRICS RS-04-26, DAIMI, Dept. of Computer Science, University of Aarhus, 2004. Prel. version in Proc. of 2nd Int. Wksh. on Rule-Based Programming, RULE 2001. Electron. Notes in Theor. Comput. Sci. 59 4 (2001) 358-374
34. Danvy O., and Schultz U.P. Lambda-lifting in quadratic time. J. Funct. Logic Program (2004) article 1
35. E.W. Dijkstra, A case against the GO TO statement, EWD 215, 1968, Available online at: http://www.cs.utexas.edu/users/EWD/
36. Dijkstra E.W. Go To statement considered harmful. Commun. ACM 11 3 (1968) 147-148
37. E.W. Dijkstra, From my life, EWD 1166, 1993, Available online at: http://www.cs.utexas.edu/users/EWD/
38. Dutchyn C.J. Specializing continuations: A model for dynamic join points. Proc. of 6th Wksh. on Foundations of Aspect-Oriented Languages. FOAL '07, Vancouver, BC, March 2007. ACM Int. Conf. Proc. Series vol. 206 (2007), ACM Press, New York 45-57
39. Felleisen M. Reflections on Landin's J operator: A partly historical note. Comput. Lang. 12 3-4 (1987) 197-207
40. Felleisen M. The theory and practice of first-class prompts. Conf. Record of 15th Ann. ACM Symposium on Principles of Programming Languages. POPL '88, San Diego, CA, Jan. 1988 (1988), ACM Press, New York 180-190
41. Felleisen M., and Friedman D.P. Control operators, the SECD machine, and the λ-calculus. In: Wirsing M. (Ed). Formal Description of Programming Concepts III (1987), North-Holland, Amsterdam 193-217
42. Filliâtre J.-C., and Pottier F. Producing all ideals of a forest, functionally. J. Funct. Programming 13 5 (2003) 945-956
43. Floyd R.W. Syntactic analysis and operator precedence. J. ACM 10 3 (1963) 316-333
44. Graunke P.T., Findler R.B., Krishnamurthi S., and Felleisen M. Automatically restructuring programs for the web. Autom. Softw. Eng. 11 4 (2004) 337-364
45. Grégoire B., and Leroy X. A compiled implementation of strong reduction. Proc. of 2002 ACM SIGPLAN Int. Conf. on Functional Programming. ICFP 2002, Pittsburgh, PA, Oct. 2002 (2002), ACM Press, New York 235-246 (= ACM SIGPLAN Notices 37 (2))
46. Harper R. Proof-directed debugging. J. Funct. Programming 9 4 (1999) 463-469
47. Henderson P., and Morris Jr. J.H. A lazy evaluator. Conf. Record of 3rd Ann. ACM Symposium on Principles of Programming Languages. POPL'76, Atlanta, GA, Jan. 1976 (1976), ACM Press, New York 95-103
48. Hughes J. A novel representation of lists and its application to the function reverse. Inform. Process. Lett. 22 3 (1986) 141-144
49. Johnsson T. Lambda lifting: Transforming programs to recursive equations. In: Jouannaud J.-P. (Ed). Proc. of 2nd ACM Conf. on Functional Programming Languages and Computer Architecture. FPCA'85, Nancy, Sept. 1985. Lect. Notes in Comput. Sci. vol. 201 (1985), Springer, Berlin 190-203
50. Kluge W.E. Abstract Computing Machines: A Lambda Calculus Perspective. Texts in Theoretical Computer Science : An EATCS Series (2005), Springer, Berlin
51. Lescanne P. From λ σ to λ v a journey through calculi of explicit substitutions. Conf. Record of 21st Ann. ACM Symp. on Principles of Programming Languages. POPL '94, Portland, OR, Jan. 1994 (1994), ACM Press, New York 60-69
52. McCarthy J. Another samefringe. SIGART Newsletter 61 (1977)
53. J. Midtgaard, Transformation, analysis, and interpretation of higher-order procedural programs, Ph.D. thesis, BRICS, University of Aarhus, 2007
54. K. Millikin, A structured approach to the transformation, normalization and execution of computer programs, Ph.D. Thesis, BRICS, University of Aarhus, 2007
55. J. Munk, A study of syntactic and semantic artifacts and its application to lambda definability, strong normalization, and weak normalization in the presence of state, Master's Thesis, Dept. of Computer Science, University of Aarhus, 2007
56. L.R. Nielsen, A denotational investigation of defunctionalization, Research Report BRICS RS-00-47, Dept. of Computer Science, University of Aarhus, 2000
57. Plotkin G.D. Call-by-name, call-by-value and the λ-calculus. Theoret. Comput. Sci. 1 (1975) 125-159
58. Pottier F., and Gauthier N. Polymorphic typed defunctionalization and concretization. Higher-Order Symb. Comput. 19 1 (2006) 125-162
59. Reynolds J.C. Definitional interpreters for higher-order programming languages. Proc. of 25th ACM Nat. Conf., Boston, MA, Aug. 1972 (1972), ACM Press, New York 717-740 Reprinted in Higher-Order and Symb. Comput. 11 (4) (1998) 363-397, with a foreword [61]
60. Reynolds J.C. The discoveries of continuations. Lisp Symb. Comput. 6 3-4 (1993) 233-247
61. Reynolds J.C. Definitional interpreters revisited. Higher-Order Symb. Comput. 11 4 (1998) 355-361
62. Reynolds J.C. Theories of Programming Languages (1998), Cambridge University Press, Cambridge
63. Schmidt D.A. State transition machines for lambda calculus expressions. In: Jones N.D. (Ed). Proc. of Wksh. on Semantics-Directed Compiler Generation, Aarhus, Jan. 1980. Lect. Notes in Comput. Sci. vol. 94 (1980), Springer, Berlin pp. 415-400
64. Schmidt D.A. State-transition machines for lambda-calculus expressions. Higher-Order Symb. Comput. 20 3 (2007) 319-332 Journal version of [63], with an afterword [65]
65. Schmidt D.A. State-transition machines, revisited. Higher-Order Symb. Comput. 20 3 (2007) 333-335
66. O. Shivers, Control-flow analysis of higher-order languages or taming lambda, Ph.D. Thesis, Techn. Report CMU-CS-91-145, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1991
67. G.L. Steele Jr., Rabbit: A compiler for Scheme, Master's Thesis, Techn. Report AI-TR-474, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 1978
68. Tolmach A.P., and Oliva D.P. From ML to Ada: Strongly-typed language interoperability via source translation. J. Funct. Programming 8 4 (1998) 367-412
69. Wadsworth C.P. Some unusual λ-calculus numeral schemes. In: Seldin J.P., and Hindley J.R. (Eds). To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (1980), Academic Press, London 215-230
70. Warren D.H.D. Higher-order extensions to PROLOG: Are they needed?. In: Hayes J.E., Michie D., and Pao Y.-H. (Eds). Machine Intelligence vol. 10 (1982), Ellis Horwood, Chichester 441-454
71. Yi K. "Proof-directed debugging" revisited for a first-order version. J. Funct. Programming 16 6 (2006) 663-670