A computational formalization for partial evaluation

Mathematical Structures in Computer Science

Volumn 7, Issue 5, 1997, Pages 507-541

  Hatclifft, John ^a   Danvy, Olivier ^b  

^a Department of Computer Science   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85002306430     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0960129597002405     Document Type: Article

References (59)

1. Andersen, L. O. (1994) Program Analysis and Specialization for the C Programming Language. Ph.D. thesis, DIKU, Computer Science Department, University of Copenhagen (DIKU Rapport 94/19).
2. Barendregt, H. (1984) The Lambda Calculus - Its Syntax and Semantics, North-Holland.
3. Benton, P.N. (1995) Strictness Analysis of Lazy Functional Programs, Ph.D. thesis, Computer Laboratory, University of Cambridge.
4. Benton, P.N., Bierman, G. M. and de Paiva, V. C. V. (1995) Computational types from a logical perspective I. Technical report 365, Computer Laboratory, University of Cambridge.
5. Bondorf, A. (1992) Improving binding times without explicit cps-conversion. In: Clinger, W. (ed.) Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, San Francisco, California. LISP Pointers V (1) 1–10.
6. Bondorf, A. and Danvy, O. (1991) Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Computer Programming 16 151–195.
7. Bondorf, A. and Dussart, D. (1994) Improving CPS-based partial evaluation: Writing cogen by hand. In: Sestoft, P. and Sondergaard, H. (eds.) Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, Orlando, Florida. Technical Report 94/9, University of Melbourne 1–10. Consel, C. A tour of Schism: A partial evaluation system for higher-order applicative languages. In: Schmidt, D. A. (ed.) Proceedings of the Second ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Copenhagen, Denmark, ACM Press 145–154.
8. Consel, C. and Danvy, O. (1991) For a better support of static data flow. In: Hughes, J. (ed.) Proceedings of the Fifth ACM Conference on Functional Programming and Computer Architecture, Cambridge, Massachusetts. Springer-Verlag Lecture Notes in Computer Science 523 496–519.
9. Consel, C. and Danvy, O. (1993) Tutorial notes on partial evaluation. In: Graham, S.L. (ed.) Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages, Charleston, South Carolina, ACM Press 493–501.
10. Crole, R.L. and Gordon, A.D. (1993) Factoring an adequacy proof (preliminary report). In: O’Donnell, J. T. and Hammond, K. (eds.) Functional Programming, Glasgow 1993 Workshops in Computing, Springer-Verlag 9–25.
11. Crole, R. L. and Pitts, A. M. (1992) New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic. Information and Computation 98 171–210.
12. Danvy, O. (1996) Type-directed partial evaluation. In: Steele Jr., G. L. (ed.) Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, ACM Press 242–257.
13. Danvy, O. and Filinski, A. (1992) Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science 2 (4) 361–391.
14. Danvy, O. and Hatcliff, J. (1993) CPS transformation after strictness analysis. ACM Letters on Programming Languages and Systems 1 (3) 195–212.
15. Danvy, O., Malmkjaer, K. and Palsberg, J. (1995) The essence of eta-expansion in partial evaluation. LISP and Symbolic Computation 8 (3) 209–227. (An earlier version appeared in the proceedings of the 1994 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation.)
16. Danvy, O., Malmkjaer, K. and Palsberg, J. (1996) Eta-expansion does The Trick. ACM Transactions on Programming Languages and Systems (to appear).
17. Davies, R. (1996) A temporal-logic approach to binding-time analysis. In: Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, IEEE Computer Society Press 184–195.
18. Davies, R. and Pfenning, F. (1996) A modal analysis of staged computation. In: Steele Jr., G.L. (ed.) Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, ACM Press 258–283.
19. Dussart, D. (1997) Ph.D. thesis, Katholieke Universiteit Leuven, Leuven, Belgium (forthcoming).
20. Dussart, D. and Thiemann, P. (1996) Imperative functional specialization. Berichte des Wilhelm-Schickard-Instituts WSI-96-28, Universitat Tubingen.
21. Filinski, A. (1994) Representing monads. In: Boehm, H.-J. (ed.) Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, Oregon, ACM Press 446–457.
22. Flanagan, C., Sabry, A., Duba, B. F. and Felleisen, M. (1994) The essence of compiling with continuations. In: Wall, D.W. (ed.) Proceedings of the ACM SIGPLAN’93 Conference on Programming Languages Design and Implementation, Albuquerque, New Mexico. SIGPLAN Notices 28 (6) 237–247.
23. Girard, J.-Y., Lafont, Y. and Taylor, P. (1989) Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7, Cambridge University Press. Gluck, R. and Jorgensen. J. (1995) Efficient multi-level generating extensions for program spe-cialization. In: Hermenegildo, M. and Swierstra, S.D. (eds.) Seventh International Symposium on Programming Language Implementation and Logic Programming, Utrecht, The Netherlands. Springer-Verlag Lecture Notes in Computer Science 982.
24. Gluck, R. and Jorgensen. J. (1993) Occam’s razor in metacomputation: the notion of a perfect process tree. In: Cousot, P., Falaschi M., Filé G. and Rauzy, A. (eds.) Proceedings of the Third International Workshop on Static Analysis WSA’93, Padova, Italy. Springer-Verlag Lecture Notes in Computer Science 724 112–123.
25. Gomard, C.K. (1992) A self-applicable partial evaluator for the lambda-calculus: Correctness and pragmatics. ACM Transactions on Programming Languages and Systems 14 (2) 147–172.
26. Gomard, C. K. and Jones, N. D. (1991) A partial evaluator for the untyped lambda-calculus. Journal of Functional Programming 1(1) 21–69.
27. Gordon, A. D. (1993) Functional Programming and Input/Output, Ph.D. thesis, Computer Laboratory, University of Cambridge (Technical Report No. 285).
28. Gunter, C. A. (1992) Semantics of Programming Languages: Structures and Techniques, MIT Press.
29. Hannan, J. and Miller, D. (1989) Deriving mixed evaluation from standard evaluation for a simple functional language. In: van de Snepscheut, J.L. A. (ed.) Proceedings of a Conference on Mathematics of Program Construction, Groningen, The Netherlands. Springer-Verlag Lecture Notes in Computer Science 375 239–255.
30. Hatcliff, J. (1994) The Structure of Continuation-Passing Styles, Ph.D. thesis, Department of Computing and Information Sciences, Kansas State University. Hatcliff, J. (1995) Mechanically verifying the correctness of an offline partial evaluator. In: Hermenegildo, M. and Swierstra, S. D. (eds.) Seventh International Symposium on Programming Language Implementation and Logic Programming, Utrecht, The Netherlands. Springer-Verlag Lecture Notes in Computer Science 982 279–298.
31. Hatcliff, J. and Danvy, O. (1994) A generic account of continuation-passing styles. In: Boehm, H.-J. (ed.) Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, Oregon, ACM Press 458–471.
32. Hatcliff, J. and Danvy, O. (1996) A computational formalization for partial evaluation (extended version). Technical Report BRICS RS-96-34, Computer Science Department, Aarhus University.
33. Hatcliff, J. and Gluck, R. (1996) An operational theory of self-applicable on-line program special-ization. In: Danvy, O., Gluck, R. and Thiemann, P. (eds.) Partial Evaluation, Dagstuhl, Germany. Springer-Verlag Lecture Notes in Computer Science 1110 161–182.
34. Holst, C.K. and Gomard, C.K. (1991) Partial evaluation is fuller laziness. In: Hudak, P. and Jones, N. D. (eds.) Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut. SIGPLAN Notices 26 (9) 223–233.
35. Jones, N. D., Gomard, C. K. and Sestoft, P. (1993) Partial Evaluation and Automatic Program Generation, Prentice Hall International Series in Computer Science.
36. Jones, N.D., Sestoft, P. and Sondergaard, H. (1989) MIX: A self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation 2 (1) 9–50.
37. Launchbury, J. (1991) A strongly-typed self-applicable partial evaluator. In: Hughes, J. (ed.) Pro-ceedings of the Fifth ACM Conference on Functional Programming and Computer Architecture, Cambridge, Massachusetts. Springer-Verlag Lecture Notes in Computer Science 523 145–164.
38. Lawall, J.L. and Danvy, O. (1994) Continuation-based partial evaluation. In: Talcott, C.L. (ed.) Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, Orlando, Florida. LISP Pointers VII (3). Lawall, J. L. and Danvy, O. Continuation-based partial evaluation. Technical Report CS-95-178, Computer Science Department, Brandeis University, Waltham, Massachusetts, January 1995. (An earlier version appeared in the proceedings of the 1994 ACM Conference on Lisp and Functional Programming.)
39. Liang, S., Hudak, P. and Jones, M. (1995) Monad transformers and modular interpreters. In: Lee, P. (ed.) Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages, San Francisco, California 333–343.
40. Moggi, E. (1991) Notions of computation and monads. Information and Computation 93 55–92.
41. Nielsen, K. (1997) Master’s thesis, DIKU, Computer Science Department, University of Copenhagen (forthcoming).
42. Nielsen, K. and Sorensen, M. H. (1995) Call-by-name CPS-translation as a binding-time improve-ment. In: Mycroft, A. (ed.) Static Analysis. Springer-Verlag Lecture Notes in Computer Science 983 296–313.
43. Nielson, F. (1982) A denotational framework for data flow analysis. Acta Informatica 18 265–287.
44. Nielson, F. and Nielson, H. R. (1992a) Two-Level Functional Languages, Cambridge Tracts in Theoretical Computer Science 34, Cambridge University Press.
45. Nielson, H. R. and Nielson, F. (1992b) Semantics with Applications, a formal introduction, Wiley Professional Computing, John Wiley and Sons.
46. Palsberg, J. (1993) Correctness of binding-time analysis. In: Jones, N. D. (ed.) Journal of Functional Programming 3 (3) (Special issue on Partial Evaluation) 347–363.
47. Paulin-Mohring, C. and Werner, B. (1993) Synthesis of ML programs in the system Coq. Journal of Symbolic Computation 15 607–640.
48. Plotkin, G. D. (1975) Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1 125–159.
49. Prawitz, D. (1965) Natural Deduction, Almquist and Wiksell, Uppsala.
50. Sabry, A. and Felleisen, M. (1993) Reasoning about programs in continuation-passing style. LISP and Symbolic Computation 6 (3 4) 289–360.
51. Sabry, A. and Felleisen, M. (1994) Is continuation-passing useful for data flow analysis? In: Sarkar, V. (ed.) Proceedings of the ACM SIGPLAN’94 Conference on Programming Languages Design and Implementation, Orlando, Florida. SIGPLAN Notices 29 (6) 1–12.
52. Sabry, A. and Wadler, P. (1996) Compiling with reflections. In: Dybvig, R.K. (ed.) Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, Philadelphia, Pennsylvania, ACM Press 13–24.
53. Sands, D. (1995) Proving the correctness of recursion-based automatic program transformations. In: Mosses, P., Nielsen, M., and Schwartzbach, M. (eds.) Proceedings of TAPSOFT ’95, Aarhus, Denmark. Springer-Verlag Lecture Notes in Computer Science 915 681–695.
54. Sorensen, M. H., Glück, R. and Jones, N. (1994) Towards unifying partial evaluation, deforestation, supercompilation, and GPC. In: Sannella, D. (ed.) Proceedings of the Fifth European Symposium on Programming, Edinburgh, Scotland. Springer-Verlag Lecture Notes in Computer Science 788 485–500.
55. Steele Jr., G. L. (1994) Building interpreters by composing monads. In: Boehm, H.-J. (ed.) Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, Oregon, ACM Press 472–492.
56. Talcott, C. (1992) A theory for program and data type specification. Theoretical Computer Science 104 (1) 129–159.
57. Thiemann, P. (1996) Cogen in six lines in: Dybvig, R. K. (ed.) Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, Philadelphia, Pennsylvania, ACM Press 180–189. Wadler, P. (1992a) The essence of functional programming (tutorial). In: Appel, A.W. (ed.) Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, ACM Press 1–14.
58. Wadler, P. (1992b) Comprehending monads. Mathematical Structures in Computer Science 2 (4) 461–493.
59. Wand, M. (1993) Specifying the correctness of binding-time analysis. In: Jones, N. D. (ed.) Journal of Functional Programming 3 (3) (Special issue on Partial Evaluation) 365–387.