A New Machine-checked Proof of Strong Normalisation for Display Logic (2002)
| Venue: | Electronic Notes in Theoretical Computer Science |
| Citations: | 5 - 2 self |
BibTeX
@INPROCEEDINGS{Dawson02anew,
author = {Jeremy E. Dawson and Rajeev Goré},
title = {A New Machine-checked Proof of Strong Normalisation for Display Logic},
booktitle = {Electronic Notes in Theoretical Computer Science},
year = {2002},
publisher = {Elsevier}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We use a deep embedding of the display calculus for relation algebras #RA in the logical framework Isabelle/HOL to formalise a new, machine-checked, proof of strong normalisation and cut-elimination for #RA which does not use measures on the size of derivations. Our formalisation generalises easily to other display calculi and can serve as a basis for formalised proofs of strong normalisation for the classical and intuitionistic versions of a vast range of substructural logics like the Lambek calculus, linear logic, relevant logic, BCK-logic, and their modal extensions. We believe this is the first full formalisation of a strong normalisation result for a sequent system using a logical framework.
