Communication Dans Un Congrès Année : 2024

Confluence for Proof-Nets via Parallel Cut Elimination

Résumé

We provide the first proof of confluence for cut elimination in multiplicative-exponential linear logic proof-nets that is not based on Newman’s lemma or strong normalization, not even indirectly. To achieve our goal, we take inspiration from Tait and Martin-Lof’s method based on parallel reduction for the lambda-calculus, even though the wilder realm of untyped proof-nets makes the proof subtler and more challenging.

Fichier principal
Vignette du fichier
LPAR_2024_pages_464-483.pdf (544.29 Ko) Télécharger le fichier

Dates et versions

hal-04938978 , version 1 (19-06-2025)

Licence

Identifiants

Citer

Giulio Guerrieri, Giulia Manara, Lorenzo Tortora de Falco, Lionel Vaux Auclair. Confluence for Proof-Nets via Parallel Cut Elimination. 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, May 2024, Balaclava, Mauritius. pp.464-443, ⟨10.29007/vkfn⟩. ⟨hal-04938978⟩
141 Consultations
105 Téléchargements

Altmetric

Partager

  • More