,
Octavio Malherbe
Creative Commons Attribution 4.0 International license
Traditional approaches to modelling parallelism and algebraic structure in lambda calculi often rely on monads - as in Moggi’s framework - or on rich categorical structures such as biproducts - as used in certain models of linear logic. In this work, we propose a minimal alternative that captures both parallelism and weighted parallelism (linear combinations) within the setting of intuitionistic propositional logic, without resorting to monads or assuming the existence of biproducts.
We introduce two lambda calculi: a parallel lambda calculus and an algebraic lambda calculus, both extending full propositional intuitionistic logic. Their semantics are given in two categories: Mag_{Set}, whose objects are magmas and arrows are functions in Set; and AMag^{𝒮}_{Set}, whose objects are action magmas.
The key technical challenge addressed is the interpretation of disjunction in the presence of parallel and algebraic operators. Since the usual coproduct structure is unavailable in our minimal setting, we propose a novel set-theoretic interpretation based on the union of the disjoint union and the Cartesian product. This allows for the construction of sound and adequate models for both calculi.
Our results offer a unified and structurally lightweight framework for modelling parallelism and algebraic effects in intuitionistic logic, opening the way to alternatives beyond the traditional monadic or linear logic approaches.
@InProceedings{diazcaro_et_al:LIPIcs.FSTTCS.2025.28,
author = {D{\'\i}az-Caro, Alejandro and Malherbe, Octavio},
title = {{Beyond Monads and Biproducts: A Uniform Interpretation of Parallelism in Intuitionistic Logic}},
booktitle = {45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025)},
pages = {28:1--28:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-406-2},
ISSN = {1868-8969},
year = {2025},
volume = {360},
editor = {Aiswarya, C. and Mehta, Ruta and Roy, Subhajit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.28},
URN = {urn:nbn:de:0030-drops-251098},
doi = {10.4230/LIPIcs.FSTTCS.2025.28},
annote = {Keywords: Algebraic lambda calculus, Categorical semantics, Disjunction, Proof theory}
}