Formalizing a strong normalization proof for Moggi's computational metalanguage: a case study in Isabelle/HOL-nominal

Authors:
Christian Doczkal;Jan Schwinghammer
Affiliations:
Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany
Venue:
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Year:
2009

Citing 12
Cited 1

Proofs and types

Proofs and types
Notions of computation and monads

Information and Computation
A Formalization of the Strong Normalization Proof for System F in LEGO

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Nominal logic, a first order theory of names and binding

Information and Computation - TACS 2001
Alpha-structural recursion and induction

Journal of the ACM (JACM)
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F

Electronic Notes in Theoretical Computer Science (ENTCS)
Engineering formal metatheory

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal Techniques in Isabelle/HOL

Journal of Automated Reasoning
Structural Logical Relations

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Formalising the π-calculus using nominal logic

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Reducibility and ⊤⊤-lifting for computation types

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Normalization by Evaluation and Algebraic Effects

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lindley and Stark have given an elegant proof of strong normalization for various lambda calculi whose type systems preclude a direct inductive definition of Girard-Tait style logical relations, such as the simply typed lambda calculus with sum types or Moggi's calculus with monadic computation types. The key construction in their proof is a notion of relational TT-lifting, which is expressed with the help of stacks of evaluation contexts. We describe a formalization of Lindley and Stark's strong normalization proof for Moggi's computational metalanguage in Isabelle/HOL, using the nominal package.