Normalization by evaluation for the computational lambda-calculus

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

Volumn 2044 LNCS, Issue , 2001, Pages 151-165

  Filinski, Andrzej ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); PATHOLOGY; SEMANTICS; TEMPORAL LOGIC; COMPUTATIONAL MECHANICS;

COMPUTATIONAL EFFECTS; COMPUTATIONAL LAMBDA CALCULUS; FUNCTIONAL PROGRAMS; ML-LIKE LANGUAGES; NORMALIZATION ALGORITHMS; NORMALIZATION BY EVALUATION; PARTIAL EVALUATION; SEMANTIC CHARACTERIZATIONS; NORMAL FORM;

CALCULATIONS;

EID: 84888865097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45413-6_15     Document Type: Conference Paper

References (18)

1. Thorsten Altenkirch, Martin Hofmann, and Thomas Streicher. Categorical reconstruction of a reduction free normalization proof. In Category Theory and Computer Science, 6th International Conference, number 953 in Lecture Notes in Computer Science, 1995.
2. Ulrich Berger. Program extraction from normalization proofs. In M. Bezem and J. F. Groote, editors, Typed Lambda Calculi and Applications, number 664 in Lecture Notes in Computer Science, pages 91-106, Utrecht, The Netherlands, March 1993.
3. Ulrich Berger, Matthias Eberl, and Helmut Schwichtenberg. Normalization by evaluation. In Prospects for Hardware Foundations (NADA), number 1546 in Lecture Notes in Computer Science, pages 117-137, 1998.
4. Ulrich Berger and Helmut Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. In Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pages 203-211, Amsterdam, The Netherlands, July 1991
5. Thierry Coquand and Peter Dybjer. Intuitionistic model constructions and nor-malization proofs. Mathematical Structures in Computer Science, 7:75-94, 1997.
6. Djordje Čubrić, Peter Dybjer, and Philip Scott. Normalization and the Yoneda embedding. Mathematical Structures in Computer Science, 8:153-192, 1998.
7. Olivier Danvy. Type-directed partial evaluation. In J. Hatcliff, T. Æ. Mogensen, and P. Thieman, editors, Partial Evaluation-Practice and Theory; Proceedings of the 1998 DIKU Summer School, number 1706 in Lecture Notes in Computer Science, pages 367-411. Springer-Verlag, Copenhagen, Denmark, July 1998.
8. Olivier Danvy and Peter Dybjer, editors. Preliminary Proceedings of the APPSEM Workshop on Normalization by Evaluation. Department of Computer Science, University of Aarhus, May 1998. BRICS Note NS-98-1.
9. Olivier Danvy and Andrzej Filinski. Representing control: A study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, December 1992.
10. Andrzej Filinski. Representing layered monads. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 175-188, San Antonio, Texas, January 1999.
11. Andrzej Filinski. A semantic account of type-directed partial evaluation. In G. Nadathur, editor, International Conference on Principles and Practice of Declarative Programming, number 1702 in Lecture Notes in Computer Science, pages 378-395, Paris, France, September 1999.
12. Marcelo Fiore, Gordon Plotkin, and Daniele Turi. Abstract syntax and variable binding. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, pages 193-202, Trento, Italy, July 1999.
13. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 237-247, Albuquerque, New Mexico, June 1993.
14. Murdoch Gabbay and Andrew Pitts. A new approach to abstract syntax involving binders. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, pages 214-224, Trento, Italy, July 1999.
15. Bernd Grobauer and Zhe Yang. The second Futamura projection for type-directed partial evaluation. In ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 22-32. ACM Press, January 2000.
16. Eugenio Moggi. Computational lambda-calculus and monads. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 14-23, Pacific Grove, California, June 1989. IEEE.
17. Atsushi Ohori. A Curry-Howard isomorphism for compilation and program execution. In J.-Y. Girard, editor, Typed Lambda-Calculi and Applications, volume 1581 of Lecture Notes in Computer Science, L'Aquila, Italy, April 1999.
18. Eijiro Sumii and Naoki Kobayashi. Online-and-online partial evaluation: A mixed approach. In ACM SIGPLAN Workshop on Partial Evaluation and SemanticsBased Program Manipulation, pages 12-21. ACM Press, January 2000.