From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic - Theoretical Computer Science Access content directly
Conference Papers Year : 2014

From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic

Abstract

Proof theory for a logic with categorical semantics can be developed by the following methodology: define a sound and complete display calculus for an extension of the logic with additional adjunctions; translate this calculus to a shallow inference nested sequent calculus; translate this calculus to a deep inference nested sequent calculus; then prove this final calculus is sound with respect to the original logic. This complex chain of translations between the different calculi require proofs that are technically intricate and involve a large number of cases, and hence are ideal candidates for formalisation. We present a formalisation of this methodology in the case of Full Intuitionistic Linear Logic (FILL), which is multiplicative intuitionistic linear logic extended with par.
Fichier principal
Vignette du fichier
978-3-662-44602-7_20_Chapter.pdf (383.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01402048 , version 1 (24-11-2016)

Licence

Attribution

Identifiers

Cite

Jeremy E. Dawson, Ranald Clouston, Rajeev Goré, Alwen Tiu. From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.250-264, ⟨10.1007/978-3-662-44602-7_20⟩. ⟨hal-01402048⟩
47 View
122 Download

Altmetric

Share

Gmail Facebook X LinkedIn More