Strong Normalization of Moggis's Computational Metalanguage (Q7361820)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Lam-ml-Normalization
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong Normalization of Moggis's Computational Metalanguage |
AFP entry Lam-ml-Normalization |
Statements
29 August 2010
0 references
Christian Doczkal
0 references
Strong Normalization of Moggis's Computational Metalanguage (English)
0 references
Handling variable binding is one of the main difficulties in formal proofs. In this context, Moggi's computational metalanguage serves as an interesting case study. It features monadic types and a commuting conversion rule that rearranges the binding structure. Lindley and Stark have given an elegant proof of strong normalization for this calculus. The key construction in their proof is a notion of relational TT-lifting, using stacks of elimination contexts to obtain a Girard-Tait style logical relation. I give a formalization of their proof in Isabelle/HOL-Nominal with a particular emphasis on the treatment of bound variables.
0 references
