Term rewriting for normalization by evaluation

Information and Computation

Volumn 183, Issue 1, 2003, Pages 19-42

  Berger, Ulrich ^a   Eberl, Matthias ^a   Schwichtenberg, Helmut ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; EVALUATION; RECURSIVE FUNCTIONS;

REWRITING SYSTEMS;

COMPUTER SCIENCE;

EID: 0038147477     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00014-2     Document Type: Article

References (13)

1. T. Altenkirch, M. Hofmann, T. Streicher, Categorical reconstruction of a reduction free normalization proof, in: CTCS'95, Cambridge, Lecture Notes in Computer Science, vol. 953, Springer, Berlin, 1995, pp. 182-199.
2. H. Benl, U. Berger, H. Schwichtenberg, M. Seisenberger, W. Zuber, Proof theory at work: program development in the Minlog system, in: W. Bibel, P.H. Schmitt (Eds.), Automated Deduction - A Basis for Applications, Systems and Implementation Techniques of Applied Logic Series, vol. II, Kluwer Academic, Dordrecht, 1998, pp. 41-71.
3. U. Berger, Continuous functionals of dependent and transfinite types, Habilitationsschrift, Mathematisches Institut der Universität München, 1997.
4. U. Berger, M. Eberl, H. Schwichtenberg, Normalization by evaluation, in: B. Möller, J.V. Tucker (Eds.), Prospects for Hardware Foundations, Lecture Notes in Computer Science, vol. 1546, Springer, Berlin, 1998, pp. 117-137.
5. U. Berger, H. Schwichtenberg, An inverse of the evaluation functional for typed λ-calculus, in: R. Vemuri (Ed.), Proceedings 6th Symposium on Logic in Computer Science (LICS'91), IEEE Comput Society, Los Alamitos, CA, 1991, pp. 203-211.
6. T. Coquand, P. Dybjer, Intuitionistic model constructions and normalization proofs, Math. Struct. Comput. Sci. 7 (1997) 73-94.
7. R.L. Crole, Categories for Types, Cambridge University Press, Cambridge, 1993.
8. O. Danvy, Pragmatics of type-directed partial evaluation, in: O. Danvy, R. Glück, P. Thiemann (Eds.), Partial Evaluation, Lecture Notes in Computer Science, vol. 1110, Springer, Berlin, 1996, pp. 73-94.
9. N.G. de Bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, Indagationes Math. 34 (1972) 381-392.
10. A. Filinski, A semantic account of type-directed partial evaluation, in: Principles and Practice of Declarative Programming 1999, Lecture Notes in Computer Science, vol. 1702, Springer, Berlin, 1999, pp. 378-395.
11. I. Lambek, P. Scott, Introduction to Higher Order Categorical Logic, Cambridge Studies in Advanced Mathematics, vol. 7, Cambridge University Press, Cambridge, UK. 1986.
12. J. McCarthy, Recursive functions of symbolic expressions and their computation by machine, Commun. Assoc. Comput. Mach. 3 (4) (1960) 184-195.
13. G.D. Plotkin, LCF considered as a programming language, Theoret. Comput. Sci. 5 (1977) 223-255.