Description:
Formalization of weak head normalization for closed terms of system T
(evaluation) with the Church-style typing and the call-by-name
evaluation strategy.

Reuses parts of the formalization developed by Pierre Letouzey for
strong normalization of the simply typed lambda calculus (in
particular, the substitution mechanism and its properties).

Files:
MoreList.v -> list library (Letouzey)
minlog_mode.v -> some tactics (Letouzey)
Term.v -> grammar of terms (and types)
Subst.v, Subst2.v -> properties of substitutions
Typing.v -> type-checking and typing properties
Apps.v -> properties of applications
Main.v -> main proof development
Axioms.v -> (an) implementation of the signature of reduction semantics
Extract.v -> extraction to an Ocaml evaluator

Author:
Malgorzata Biernacka
Date:
June 15, 2007


