Summary: Type Structures and
Normalization by Evaluation for System F
Department of Computer Science
Computer Science Logic (CSL'09)
8 September 2009
Andreas Abel (LMU Munich) NbE for System F
CSL'09 1 / 21
Normalizers appear in compilers (e.g., type-directed partial
and HOL theorem provers (Isabelle, Coq, Agda).
Normalization by evaluation is a framework to turn an
evaluator for closed expressions (stop at lambda) into a
normalizer for open expressions (go under lambda).
Has clear semantic foundations.
Is strong for extensional normalization (eta).
My goal: NbE for Calculus of Constructions and Coq.