From reduction-based to reduction-free normalization

Electronic Notes in Theoretical Computer Science

Volumn 124, Issue 2, 2005, Pages 79-100

  Danvy, Olivier ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Continuation passing style (CPS); Defunctionalization; Normalization by evaluation; Refocusing

Indexed keywords

COMPUTATIONAL METHODS; FUNCTIONS; MAPPING; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

CONTINUATION-PASSING STYLE (CPS); DEFUNCTIONALIZATION; NORMALIZATION BY EVALUATION; REFOCUSING;

COMPUTER SCIENCE;

EID: 16644402392     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.01.007     Document Type: Conference Paper

References (45)

1. Klaus Aehlig, and Felix Joachimski Operational aspects of untyped normalization by evaluation Mathematical Structures in Computer Science 14 2004 587 611
2. Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, and Jan Midtgaard A functional correspondence between evaluators and abstract machines Dale Miller Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP'03) August 2003 ACM Press 8 19
3. Mads Sig Ager, Olivier Danvy, and Jan Midtgaard A functional correspondence between call-by-need evaluators and lazy abstract machines Information Processing Letters 90 5 2004 223 232 Extended version available as the technical report BRICS-RS-04-3
4. Mads Sig Ager, Olivier Danvy, and Jan Midtgaard A functional correspondence between monadic evaluators and abstract machines for languages with computational effects Theoretical Computer Science 2005 Accepted for publication. Extended version available as the technical report BRICS RS-04-28
5. Thorsten Altenkirch, Martin Hofmann, and Thomas Streicher Categorical reconstruction of a reduction-free normalization proof David H. Pitt David E. Rydeheard Peter Johnstone Category Theory and Computer Science Lecture Notes in Computer Science number 953 August 1995 Springer-Verlag Cambridge, UK 182 199
6. Thorsten Altenkirch, and Tarmo Uustalu Normalization by evaluation for λ → 2 Yukiyoshi Kameyama Peter J. Stuckey Functional and Logic Programming, 7th International Symposium, FLOPS 2004 Lecture Notes in Computer Science number 2998 April 2004 Springer-Verlag Nara, Japan 260 275
7. Vincent Balat, Roberto Di Cosmo, and Marcelo P. Fiore Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums Xavier Leroy Proceedings of the Thirty-First Annual ACM Symposium on Principles of Programming Languages January 2004 ACM Press Venice, Italy 64 76
8. Vincent Balat, and Olivier Danvy Memoization in type-directed partial evaluation Don Batory Charles Consel Walid Taha Proceedings of the 2002 ACM SIGPLAN/SIGSOFT Conference on Generative Programming and Component Engineering Lecture Notes in Computer Science number 2487 October 2002 Springer-Verlag Pittsburgh, Pennsylvania 78 92
9. Ulrich Berger, Matthias Eberl, and Helmut Schwichtenberg Normalization by evaluation Bernhard Möller John V. Tucker Prospects for hardware foundations (NADA) Lecture Notes in Computer Science number 1546 1998 Springer-Verlag Berlin, Germany 117 137
10. Ulrich Berger, and Helmut Schwichtenberg An inverse of the evaluation functional for typed λ-calculus Gilles Kahn Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science July 1991 IEEE Computer Society Press Amsterdam, The Netherlands 203 211
11. Ilya Beylin, and Peter Dybjer Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids Stefano Berardi Mario Coppo Types for Proofs and Programs, International Workshop TYPES'95 Lecture Notes in Computer Science number 1158 June 1995 Springer-Verlag Torino, Italy 47 61
12. Małgorzata Biernacka, Dariusz Biernacki, and Olivier Danvy. An operational foundation for delimited continuations in the CPS hierarchy. Technical Report BRICS RS-04-29, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, December 2004. A preliminary version was presented at the the Fourth ACM SIGPLAN Workshop on Continuations (CW 2004)
13. Dariusz Biernacki, and Olivier Danvy From interpreter to logic engine by defunctionalization Maurice Bruynooghe Logic Based Program Synthesis and Transformation, 13th International Symposium, LOPSTR 2003 Lecture Notes in Computer Science number 3018 August 2003 Springer-Verlag Uppsala, Sweden 143 159
14. Thierry Coquand, and Peter Dybjer Intuitionistic model constructions and normalization proofs Mathematical Structures in Computer Science 7 1997 75 94
15. Pierre Crégut An abstract machine for lambda-terms normalization Mitchell Wand Proceedings of the 1990 ACM Conference on Lisp and Functional Programming June 1990 ACM Press Nice, France 333 340
16. Djordje Čubrić, Peter Dybjer, and Philip J. Scott Normalization and the Yoneda embedding Mathematical Structures in Computer Science 8 1998 153 192
17. Olivier Danvy Back to direct style Science of Computer Programming 22 3 1994 183 195
18. Olivier Danvy Type-directed partial evaluation Guy L. Steele Jr. Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages January 1996 ACM Press St. Petersburg Beach, Florida 242 257
19. Olivier Danvy Type-directed partial evaluation John Hatcliff Torben Æ. Mogensen Peter Thiemann Partial Evaluation - Practice and Theory Proceedings of the 1998 DIKU Summer School Lecture Notes in Computer Science number 1706 July 1998 Springer-Verlag Copenhagen, Denmark 367 411
20. Olivier Danvy. On evaluation contexts, continuations, and the rest of the computation. In Hayo Thielecke, editor, Proceedings of the Fourth ACM SIGPLAN Workshop on Continuations, Technical report CSR-04-1, Department of Computer Science, Queen Mary's College, pages 13-23, Venice, Italy, January 2004. Invited talk
21. Olivier Danvy A rational deconstruction of Landin's SECD machine Clemens Grelck Frank Huch Implementation and Application of Functional Languages, 16th International Workshop, IFL'04 Lecture Notes in Computer Science September 2004 Springer-Verlag Lübeck, Germany To appear. Extended version available as the technical report BRICS-RS-03-33
22. Olivier Danvy and Peter Dybjer, editors. Proceedings of the 1998 APPSEM Workshop on Normalization by Evaluation (NBE 1998), BRICS Note Series NS-98-8, Gothenburg, Sweden, May 1998. BRICS, Department of Computer Science, University of Aarhus
23. Olivier Danvy, and Andrzej Filinski Representing control, a study of the CPS transformation Mathematical Structures in Computer Science 2 4 1992 361 391
24. Olivier Danvy, and Lasse R. Nielsen Defunctionalization at work Harald Søndergaard Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'01) September 2001 ACM Press Firenze, Italy 162 174 Extended version available as the technical report BRICS RS-01-23
25. Olivier Danvy and Lasse R. Nielsen. Refocusing in reduction semantics. Technical Report BRICS RS-04-26, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, November 2004. A preliminary version appears in the informal proceedings of the Second International Workshop on Rule-Based Programming (RULE 2001), Electronic Notes in Theoretical Computer Science, Vol. 59.4
26. Peter Dybjer, and Andrzej Filinski Normalization and partial evaluation Gilles Barthe Peter Dybjer Luís Pinto João Saraiva Applied Semantics - Advanced Lectures Lecture Notes in Computer Science number 2395 September 2000 Springer-Verlag Caminha, Portugal 137 192
27. Matthias Felleisen. The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages. PhD thesis, Department of Computer Science, Indiana University, Bloomington, Indiana, August 1987
28. Matthias Felleisen, and Matthew Flatt Programming languages and lambda calculi Unpublished lecture notes http://www.ccs.neu.edu/home/matthias/3810-w02/ readings.html 1989-2003
29. Andrzej Filinski A semantic account of type-directed partial evaluation Gopalan Nadathur Proceedings of the International Conference on Principles and Practice of Declarative Programming Lecture Notes in Computer Science number 1702 September 1999 Springer-Verlag Paris, France 378 395 Extended version available as the technical report BRICS RS-99-17
30. Andrzej Filinski, and Henning Korsholm Rohde A denotational account of untyped normalization by evaluation Igor Walukiewicz Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004 Lecture Notes in Computer Science number 2987 April 2002 Springer-Verlag Barcelona, Spain 167 181
31. Steven E. Ganz, Daniel P. Friedman, and Mitchell Wand Trampolined style Peter Lee Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming September 1999 ACM Press Paris, France 18 27
32. Mayer Goldberg Gödelization in the λ-calculus Information Processing Letters 75 1-2 2000 13 16
33. Benjamin Grégoire, and Xavier Leroy A compiled implementation of strong reduction Simon Peyton Jones Proceedings of the 2002 ACM SIGPLAN International Conference on Functional Programming SIGPLAN Notices 37 9 September 2002 235 246 ACM Press, Pittsburgh, Pennsylvania
34. Thérèse Hardin, Luc Maranget, and Bruno Pagano Functional runtime systems within the lambda-sigma calculus Journal of Functional Programming 8 2 1998 131 172
35. Yoshiki Kinoshita A bicategorical analysis of E-categories Mathematica Japonica 47 1 1998 157 169
36. Simon Marlow, and Simon L. Peyton Jones Making a fast curry: push/enter vs. eval/apply for higher-order languages Kathleen Fischer Proceedings of the 2004 ACM SIGPLAN International Conference on Functional Programming September 2004 ACM Press Snowbird, Utah 4 15
37. Per Martin-Löf About models for intuitionistic type theories and the notion of definitional equality Proceedings of the Third Scandinavian Logic Symposium Studies in Logic and the Foundation of Mathematics volume 82 1975 North-Holland 81 109
38. Clement L. McGowan. The correctness of a modified SECD machine. In Proceedings of the Second Annual ACM Symposium in the Theory of Computing, pages 149-157, Northampton, Massachusetts, May 1970
39. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen The Definition of Standard ML (Revised) 1997 The MIT Press
40. Gordon D. Plotkin. A structural approach to operational semantics. Technical Report FN-19, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, September 1981
41. John C. Reynolds Using functor categories to generate intermediate code Peter Lee Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages January 1995 ACM Press San Francisco, California 25 36
42. John C. Reynolds Definitional interpreters for higher-order programming languages Higher-Order and Symbolic Computation 11 4 1998 363 397 Reprinted from the proceedings of the 25th ACM National Conference (1972), with a foreword
43. Guy L. Steele Jr. Rabbit: A compiler for Scheme. Master's thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978. Technical report AI-TR-474
44. René Vestergaard The simple type theory of normalisation by evaluation Bernhard Gramlich Salvador Lucas Proceedings of the First International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) Electronic Notes in Theoretical Computer Science number 57 May 2001 Elsevier Science Utrecht, The Netherlands
45. Yong Xiao, Amr Sabry, and Zena M. Ariola From syntactic theories to interpreters: Automating proofs of unique decomposition Higher-Order and Symbolic Computation 14 4 2001 387 409