Equality and fixpoints in the calculus of structures
- Kaustuv Chaudhuri,
- Nicolas Guenot
- The French National Institute for Computer Science (INRIA),
- Computer Science Laboratory of the École polytechnique,
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOpen access
Publication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 30-40 (10 pages)Publication milestones
- Published - 12/09/2014
Publication status
Published - 12/09/2014
Publisher
Association for Computing Machinery, United StatesBook series
- Book series name: Annual Symposium on Logic in Computer Science
ISSN: 1043-6871
ISBN (Print)
978-1-4503-2886-9Publication IDs
- Scopus: 84905965138
Host publication title
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), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014Host publication editors
- Thomas A. Henzinger
- Dale Miller
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.
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.
Publication metrics
PlumX, opens in new tab
Captures
6
