 
Summary: Towards Normalization by Evaluation
for the Calculus of Constructions
Andreas Abel
Department of Computer Science
LudwigMaximiliansUniversity Munich
Functional and Logic Programming Symposium
FLOPS 2010, Sendai, Japan
1921 April 2010
Andreas Abel (LMU) NbE for CoC FLOPS'10 1 / 19
Introduction
Normalization by Evaluation for Type Theory
Efficient algorithm for deciding definitional equality.
Leroy/Gregoire (ICFP 2002): Compile Coq to byte code.
Boespflug (PADL 2010): Compile (via Haskell) to machine code.
Extend type theory by in a systematic way.
"Semantic" normalization: beneficial for meta theory.
This work:
1 Basis: Untyped Normalization by Evaluation.
2 Extended by expansion for types.
3 Model to show termination and completeness of normalization.
