A Compiled Implementation of Normalization by Evaluation

Klaus Aehlig Florian Haftmann Tobias Nipkow

We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normalization of open lambda-terms w.r.t. beta-reduction and rewrite rules. We have implemented NBE and show both a detailed formal model of our implementation and its verification in Isabelle. Finally we discuss how NBE is turned into a proof rule in Isabelle.

pdf

BibTeX:

@inproceedings{AehligHN-TPHOLs08,
author={Klaus Aehlig and Florian Haftmann and Tobias Nipkow},
title={A Compiled Implementation of Normalization by Evaluation},
booktitle={Theorem Proving in Higher Order Logics (TPHOLs 2008)},
editor={Ait Mohamed and Munoz and Tahar},
publisher={Springer},series={LNCS},volume={5170},pages={39-54},year=2008}

Isabelle theories in the Archive of Formal Proofs

This paper has been superseded by an extended journal version.