Extracting a Normalization Algorithm in Isabelle/HOL

We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracted from it. Unlike many other proofs of weak normalization based on Tait’s strong computability predicates, which require a logic supporting strong eliminations and can give rise to dependent types in the extracted program, our formalization requires only relatively simple proof principles. Thus, the program obtained from this proof is typable in simply-typed higher-order logic as implemented in Isabelle/HOL, and a proof of its correctness can automatically be derived within the system.

• Type: Conference
• Year: 2004
• Where: TYPES
• Authors: Stefan Berghofer
• Keywords: Constructive Proof, Formal Methods, Theorem Prover Isabelle/hol, TYPES 2004, Weak Normalization