A compiled implementation of normalization by evaluation

Klaus Aehlig, Florian Haftmann, Tobias Nipkow

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

9 Zitate (Scopus)

Abstract

We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normalization of open λ-terms w.r.t. β-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.

OriginalspracheEnglisch
TitelTheorem Proving in Higher Order Logics - 21st International Conference, TPHOLs 2008, Proceedings
Herausgeber (Verlag)Springer Verlag
Seiten39-54
Seitenumfang16
ISBN (Print)3540710655, 9783540710653
DOIs
PublikationsstatusVeröffentlicht - 2008
Veranstaltung21st International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2008 - Montreal, QC, Kanada
Dauer: 18 Aug. 200821 Aug. 2008

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band5170 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

Konferenz21st International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2008
Land/GebietKanada
OrtMontreal, QC
Zeitraum18/08/0821/08/08

Fingerprint

Untersuchen Sie die Forschungsthemen von „A compiled implementation of normalization by evaluation“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren