@inproceedings{be1fea3406194839881452f2885e6150,
title = "Combinatorial flows \& their normalisation",
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.",
keywords = "Cut elimination, Deep inference, Proof equivalence, Substitution",
author = "Lutz Stra{\ss}burger",
year = "2017",
month = sep,
day = "1",
doi = "10.4230/LIPIcs.FSCD.2017.31",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Dale Miller",
booktitle = "2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017",
note = "2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017 ; Conference date: 03-09-2017 Through 09-09-2017",
}