A denotational account of untyped normalization by evaluation

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

Volumn 2987, Issue , 2004, Pages 167-181

  Filinski, Andrzej ^a   Rohde, Henning Korsholm ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; SEMANTICS;

CALL-BY-NAME; FORMAL CORRECTNESS; FUNCTIONAL PROGRAMS; LOGICAL RELATIONS; NORMAL FORM; NORMALIZATION ALGORITHMS; NORMALIZATION BY EVALUATION;

FUNCTION EVALUATION;

EID: 35048817996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_13     Document Type: Article

References (9)

1. Klaus Aehlig and Felix Joachimski. Operational aspects of untyped normalization by evaluation. Mathematical Structures in Computer Science, 2004(?). To appear; available from http://www.mathematik.uni-muenchen.de/ ~aehlig/pub/03-nbe.ps.
2. Ulrich Berger and Helmut Schwichtenberg. An inverse of the evaluation functional for typed A-calculus. In Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pages 203-211, Amsterdam, The Netherlands, July 1991.
3. Thierry Coquand and Peter Dybjer. Intuitionistic model constructions and normalization proofs. Mathematical Structures in Computer Science, 7:75-94, 1997.
4. Andrzej Filinski. A semantic account of type-directed partial evaluation. In G. Nadathur, editor, International Conference on Principles and Practice of Declarative Programming, volume 1702 of Lecture Notes in Computer Science, pages 378-395, Paris, France, September 1999. Springer-Verlag.
5. Andrzej Filinski and Henning Korsholm Rohde. A denotational account of untyped normalization by evaluation (extended version). BRIGS Report RS-03-40, University of Aarhus, Denmark, December 2003. Available from http://www.brics.dk/RS/03/40/.
6. Andrew M. Pitts. Computational adequacy via 'mixed' inductive definitions. In Mathematical Foundations of Programming Semantics, volume 802 of Lecture Notes in Computer Science, pages 72-82. Springer-Verlag, April 1993.
7. Andrew M. Pitts. Relational properties of domains. Information and Computation, 127(2):66-90, June 1996.
8. Gordon D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5(3):223-255, December 1977.
9. Mark R. Shinwell, Andrew M. Pitts, and Murdoch J. Gabbay. FreshML: Programming with binders made simple. In Eighth ACM SIGPLAN International Conference on Functional Programming, pages 263-274. ACM Press, Uppsala, Sweden, August 2003.