Combinatorial Flows and their Normalisation

Lutz Straßburger 1, 2
1 PARSIFAL - Proof search and reasoning with logic specifications
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : This paper introduces combinatorial flows that generalize combinatorial proofs such that they also include cut and substitution as methods of proof compression. We show a normalization procedure for combinatorial flows, and how syntactic proofs are translated into combinatorial flows and vice versa.
Document type :
Conference papers
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/hal-01635931
Contributor : Lutz Straßburger <>
Submitted on : Wednesday, November 15, 2017 - 10:13:10 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:29 PM
Long-term archiving on: Friday, February 16, 2018 - 3:45:28 PM

File

comproofcom-finalforFSCD17.pdf
Files produced by the author(s)

Identifiers

Citation

Lutz Straßburger. Combinatorial Flows and their Normalisation. FSCD 2017 - 2nd International Conference on Formal Structures for Computation and Deduction, Sep 2017, Oxford, United Kingdom. pp.311 - 3117, ⟨10.4230/LIPIcs.FSCD.2017.31⟩. ⟨hal-01635931⟩

Share

Metrics

Record views

240

Files downloads

47