Abstract. Weak normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait's computability method does not seem to be directly usable, a combinatorical proof is adapted and formalized instead.
Abel REF encodes a proof of weak normalization for STLC in Twelf.
Weak normalization for the simply-typed lambda-calculus in Twelf
In Logical Frameworks and Metalanguages (LFM 04), IJCAR
Computer Science