Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2020.29
URN: urn:nbn:de:0030-drops-123515
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12351/
DeYoung, Henry ; Pfenning, Frank ; Pruiksma, Klaas
Semi-Axiomatic Sequent Calculus
| pdf-format: |
|
Abstract
We present the semi-axiomatic sequent calculus (SAX) that blends features of Gentzen’s sequent calculus with an axiomatic formulation of intuitionistic logic. We develop and prove a suitable analogue to cut elimination and then show that a natural computational interpretation of SAX provides a simple form of shared memory concurrency.
BibTeX - Entry
@InProceedings{deyoung_et_al:LIPIcs:2020:12351,
author = {Henry DeYoung and Frank Pfenning and Klaas Pruiksma},
title = {{Semi-Axiomatic Sequent Calculus}},
booktitle = {5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)},
pages = {29:1--29:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-155-9},
ISSN = {1868-8969},
year = {2020},
volume = {167},
editor = {Zena M. Ariola},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12351},
URN = {urn:nbn:de:0030-drops-123515},
doi = {10.4230/LIPIcs.FSCD.2020.29},
annote = {Keywords: Sequent calculus, Curry-Howard isomorphism, shared memory concurrency}
}
| Keywords: | Sequent calculus, Curry-Howard isomorphism, shared memory concurrency | |
| Seminar: | 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020) | |
| Issue date: | 2020 | |
| Date of publication: | 28.06.2020 |
