Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Compiled Implementation of Normalization by Evaluation
 

Summary: A Compiled Implementation
of Normalization by Evaluation
Klaus Aehlig1
and Florian Haftmann2
and Tobias Nipkow2
1
Department of Computer Science, Swansea University
2
Institut f¨ur Informatik, Technische Universit¨at M¨unchen
Abstract. We present a novel compiled approach to Normalization by
Evaluation (NBE) for ML-like languages. It supports efficient normal-
ization of open -terms w.r.t. -reduction and rewrite rules. We have
implemented NBE and show both a detailed formal model of our imple-
mentation and its verification in Isabelle. Finally we discuss how NBE is
turned into a proof rule in Isabelle.
1 Introduction
Symbolic normalization of terms w.r.t. user provided rewrite rules is one of the
central tasks of any theorem prover. Several theorem provers (see §5) provide
especially efficient normalizers which have been used to great effect [9,14] in car-
rying out massive computations during proofs. Existing implementations per-

  

Source: Aehlig, Klaus T. - Institut für Informatik, Ludwig-Maximilians-Universität München
Nipkow, Tobias - Institut für Informatik, Technische Universität München

 

Collections: Computer Technologies and Information Sciences; Mathematics