Skip to Main content Skip to Navigation
Conference papers

Equality and fixpoints in the calculus of structures

Kaustuv Chaudhuri 1 Nicolas Guenot 2 
1 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : The standard proof theory for logics with equality and fixpoints suffers from limitations of the sequent calculus, where reasoning is separated from computational tasks such as unification or rewriting. We propose in this paper an extension of the calculus of structures, a deep inference formalism, that supports incremental and contextual reasoning with equality and fixpoints in the setting of linear logic. This system allows deductive and computational steps to mix freely in a continuum which integrates smoothly into the usual versatile rules of multiplicative-additive linear logic in deep inference.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Kaustuv Chaudhuri Connect in order to contact the contributor
Submitted on : Friday, December 5, 2014 - 4:20:12 PM
Last modification on : Thursday, January 20, 2022 - 5:30:47 PM
Long-term archiving on: : Monday, March 9, 2015 - 6:04:43 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NoDerivatives 4.0 International License




Kaustuv Chaudhuri, Nicolas Guenot. Equality and fixpoints in the calculus of structures. JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC (CSL) AND the Twenty-Ninth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS), Jul 2014, Vienna, Austria. pp.1 - 10, ⟨10.1145/2603088.2603140⟩. ⟨hal-01091570⟩



Record views


Files downloads