Combinatorial Flows and their Normalisation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Combinatorial Flows and their Normalisation

Résumé

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.
Fichier principal
Vignette du fichier
comproofcom-finalforFSCD17.pdf (588.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01635931 , version 1 (15-11-2017)

Identifiants

Citer

Lutz Strassburger. 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⟩
184 Consultations
61 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More