Term rewriting for normalization by evaluation

Authors:
Ulrich Berger;Matthias Eberl;Helmut Schwichtenberg
Affiliations:
Mathematischen Institut der Ludwig-Maximilians-Universitat Munchen, D-80333 Munchen, Germany;Mathematischen Institut der Ludwig-Maximilians-Universitat Munchen, D-80333 Munchen, Germany;Mathematischen Institut der Ludwig-Maximilians-Universitat Munchen, D-80333 Munchen, Germany
Venue:
Information and Computation - Special issue: ICC '99
Year:
2003

Citing 7
Cited 10

Introduction to higher order categorical logic

Introduction to higher order categorical logic
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Normalisation by Evaluation

Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
A Semantic Account of Type-Directed Partial Evaluation

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Pragmatics of Type-Directed Partial Evaluation

Selected Papers from the Internaltional Seminar on Partial Evaluation
Categorical Reconstruction of a Reduction Free Normalization Proof

CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
Intuitionistic model constructions and normalization proofs

Mathematical Structures in Computer Science

Alpha-structural recursion and induction

Journal of the ACM (JACM)
Normalization by Evaluation for Martin-Löf Type Theory with One Universe

Electronic Notes in Theoretical Computer Science (ENTCS)
Synthesis of Moduli of Uniform Continuity by the Monotone Dialectica Interpretation in the Proof-system MinLog

Electronic Notes in Theoretical Computer Science (ENTCS)
Light Dialectica Program Extraction from a Classical Fibonacci Proof

Electronic Notes in Theoretical Computer Science (ENTCS)
A Compiled Implementation of Normalization by Evaluation

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Nominal system T

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Simple types in type theory: deep and shallow encodings

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Minlog: a tool for program extraction supporting algebras and coalgebras

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Inverting monotone continuous functions in constructive analysis

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Conversion by evaluation

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend normalization by evaluation (first presented in [5]) from the pure typed λ-calculus to general higher type term rewriting systems and prove its correctness w.r.t. a domain-theoretic model. We distinguish between computational rules and proper rewrite rules. The former is a rather restricted class of rules, which, however, allows for a more efficient implementation.