The sup connective in IMALL: A categorical semantics
Theoretical Computer Science · 2026-05 · 1072 · 115845
DOI: 10.1016/j.tcs.2026.115845 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-05. Verfasst von Alejandro Díaz-Caro und 1 weiteren Autor:innen. Die Arbeit nennt 34 Literaturangaben. Gefördert von: European Commission Marie Sklodowska-Curie Actions, ANII, University of the Republic Sectoral Commission for Scientific Research.
Abstract (Originalsprache)
We explore a proof language for intuitionistic multiplicative additive linear logic, incorporating the sup connective that introduces additive pairs with a probabilistic elimination, and sum and scalar products within the proof-terms. We provide an abstract characterisation of the language, revealing that any symmetric monoidal closed category with biproducts and a monomorphism from the semiring of scalars to the semiring Hom(I,I) is suitable for the job. Leveraging the binary biproducts, we define a weighted codiagonal map which is at the core of the sup connective.
Förderung
- European Commission Marie Sklodowska-Curie Actions
- ANII
- University of the Republic Sectoral Commission for Scientific Research
- French National Research Agency
Zitieren
APA
Díaz-Caro, A., & Malherbe, O. (2026). The sup connective in IMALL: A categorical semantics. Theoretical Computer Science, 1072, 115845. https://doi.org/10.1016/j.tcs.2026.115845
Vancouver
Díaz-Caro A, Malherbe O. The sup connective in IMALL: A categorical semantics. Theoretical Computer Science. 2026;1072:115845. doi:10.1016/j.tcs.2026.115845
BibTeX
@article{DazCaro2026,
author = {Díaz-Caro, Alejandro and Malherbe, Octavio},
title = {The sup connective in IMALL: A categorical semantics},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1072},
pages = {115845},
doi = {10.1016/j.tcs.2026.115845}
}
EUVIMED