Sound specialization in the presence of computational effects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1281, Issue , 1997, Pages 165-190

  Lawall, Julia L ^a   Thiemann, Peter ^b  

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Continuations; Functional programming; Lambda calculus; Partial evaluation

Indexed keywords

COMPUTATIONAL MECHANICS; COMPUTER SOFTWARE; DIFFERENTIATION (CALCULUS); FUNCTIONAL PROGRAMMING;

COMPUTATIONAL EFFECTS; COMPUTATIONAL LAMBDA CALCULUS; CONTINUATION-PASSING STYLE; CONTINUATIONS; LAMBDA CALCULUS; MODEL OF COMPUTATION; PARTIAL EVALUATION; SOUND AND COMPLETE;

CALCULATIONS;

EID: 84957707421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0014551     Document Type: Conference Paper

References (38)

1. H. P. Barendregt. The Lambda Calculus-Its Syntax and Semantics. North-Holland, 1984.
2. Gilles Barthe, John Hatcliff, and Morten Heine Sørensen. Reflections on reflections. In Hugh Glaser and Herbert Kuchen, editors, Programming Languages, Implementations, Logics, and Programs (PLILP '97), volume? of Lecture Notes in Computer Science, page To appear, Southampton, England, September 1996. Springer-Verlag.
3. Anders Bondorf. Improving binding-times without explicit CPS conversion. In Proc. 1992 ACM Conference on Lisp and Functional Programming, pages 1-10, San Francisco, California, USA, June 1992.
4. Anders Bondorf and Olivier Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Proqramminn, 16(2):151-195, 1991
5. Anders Bondorf and Dirk Dussart. Improving CPS-based partial evaluation: Writing cogen by hand. In Peter Sestoft and Harald Søndergaard, editors, Proc. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation PEPM '94, pages 1-10, Orlando, Fla., June 1994. ACM.
6. Anders Bondorf and Jesper Jørgensen. Efficient analyses for realistic off-line partial evaluation: Extended version. Technical Report 93/4, DIKU, University of Copenhagen, Denmark, 1993. extended version of [7].
7. Anders Bondorf and Jesper Jørgensen, Efficient analysis for realistic off-line partial evaluation. Journal of Functional Programming, 3(3):315-346, July 1993.
8. 4 report on the algorithmic language scheme. Al Memo 848b, MIT, 1991. ftp://swiss-ftp.ai.mit.edu/pub/scm/r4rs.texi.
9. Charles Consel and Olivier Danvy. For a better support of static data flow. In John Hughes, editor, Proc. Functional Programming Languages and Computer Architecture 1991, volume 523 of Lecture Notes in Computer Science, pages 496-519, Cambridge, MA, 1991. Springer-Verlag.
10. Olivier Danvy. Back to direct style. Science of Programming, 22:183-195, 1994.
11. Olivier Danvy and Dirk Dussart. CPS transformation after binding-time analysis. Unpublished note, Computer Science Department, Aarhus University, April 1995.
12. B. A. Davey and H, A. Priestley, Introduction to Lattices and Order. Cambridge University Press, 1990.
13. th Annual IEEE Symposium on Logic in Computer Science, pages 184-195, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
14. Rowan Davies and Prank Pfenning. A modal analysis of staged computation. In Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, pages 258-270, St. Petersburg, Fla., January 1996. ACM Press.
15. Dirk Dussart and Eddy Bevers. CPS transformation after binding-time analysis (extended abstract). In Proceedings of the 7th Nordic Workshop on Programming Theory, pages 112-126, Göteborg, Sweden, November 1995.
16. Dirk Dussart and Peter Thiemann. Partial evaluation for higlier-order languages with state. Berichte des Wilhelm-Schickard-Instituts WSI-97-XX, Universität Tübingen, April 1997.
17. R. Kent Dybvig, editor. International Conference on Functional Programming, Philadelphia, PA, May 1996. ACM Press, New York.
18. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. In Proc. of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 237-247, Albuquerque, New Mexico, June 1993.
19. Robert Glück and Jesper Jørgensen. Efficient multi-level generating extensions for program specialization. In Swierstra and Hermenegildo [36], pages 259-278.
20. Carsten K. Gomard. A self-applicable partial evaluator for the lambda-calculus. ACM Transactions on Programming Languages and Systems, 14(2):147-172, 1992.
21. John Hatcliff. Mechanically verifying the correctness of an offline partial evaluator. In Swierstra and Hermenegildo [36], pages 279-298.
22. John Hatcliff and Olivier Danvy. A generic account of continuation-passing styles. In Proc. 21st Annual ACM Symposium on Principles of Programming Languages, pages 458-471, Portland, OG, January 1994. ACM Press.
23. John Hatcliff and Olivier Danvy. A computational formalization for partial evaluation. Mathematical Structures in Computer Science, 1997. To appear.
24. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
25. Julia Lawall and Olivier Danvy. Continuation-based partial evaluation. In Proc. 1994 ACM Conference on Lisp and Functional Programming,pages 227-238, Orlando, Florida, USA, June 1994. ACM Press.
26. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.
27. Eugenio Moggi. Computational lambda-calculus and monads. Technical Report ECS-LFCS-88-86, University of Edinburgh, 1988.
28. Eugenio Moggi. Computational lambda-calculus and monads. In Proc. of the 4rd Annual Symposium on Logic in Computer Science, pages 14-23, Pacific Grove, CA, June 1989. IEEE Computer Society Press.
29. Eugenio Moggi. A categorical account of two-level languages. In Proc. Mathematical Foundations of Programming Semantics, Thirteenth Annual Conference, volume 5 of Electronic Notes in Theoretical Computer Science, Pittsburgh, PA, March 1997. Carnegie Mellon University, Elsevier Science BV.
30. Flemming Nielson. A formal type system for comparing partial evaluators. In Dines Bjørner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 349-384, Amsterdam, 1988. North-Holland.
31. Flemming Nielson and Hanne Riis Nielson. Two-Level Functional Languages. Cambridge University Press, 1992.
32. Jens Palsberg. Correctness of binding-time analysis. Journal of Functional Programming, 3(3):347-364, July 1993.
33. Gordon Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1:125-159, 1975.
34. Amr Sabry and Matthias Felleisen. Reasoning about programs in continuation-passing style. Lisp and Symbolic Computation, 6(3/4):289-300, 1993.
35. Amr Sabry and Philip Wadler. A reflection on call-by-value. In Dybvig [17], pages 13-24.
36. Doaitse Swierstra and Manuel Hermenegildo, editors. Programming Languages, Implementations, Logics, and Programs (PLILP '95), volume 982 of Lecture Notes in Computer Science, Utrecht, The Netherlands, September 1995. Springer-Verlag.
37. Peter Thiemann. Cogen in six lines. In Dybvig [17], pages 180-189.
38. Mitchell Wand. Specifying the correctness of binding-time analysis. Journal of Functional Programming, 3(3):365-387, July 1993.