Metraipolis › archive › dc_37fd0ee8bcec
Quantalic lambda-calculus and additive disjunction — arXiv:2608.06120
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.06120
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T10:50:27.273Z
- SHA-256 of the archived text
cff3d10c75436f5ad0590d1611cda9ed0d54d4c8d0f38f1259d41b769e4118a5- Stable URL of this page
https://metraipolis.com/documento/dc_37fd0ee8bcec
How to cite
Quantalic lambda-calculus and additive disjunction — arXiv:2608.06120 — arXiv (en), https://arxiv.org/abs/2608.06120 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_37fd0ee8bcec (Metraipolis archive dc_37fd0ee8bcec, sha256 cff3d10c75436f5ad0590d1611cda9ed0d54d4c8d0f38f1259d41b769e4118a5)
BibTeX
@misc{dc37fd0ee8bcec,
title = {Quantalic lambda-calculus and additive disjunction — arXiv:2608.06120},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.06120},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_37fd0ee8bcec; sha256 cff3d10c75436f5ad0590d1611cda9ed0d54d4c8d0f38f1259d41b769e4118a5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.06120. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Motivated by the need to reason about case statements quantitatively, we extend quantalic linear lambda-calculus with additive disjunction. We show that the resulting equational system is sound. We also show that when certain continuity properties (of the underlying quantale) are adopted, it is additionally (approximately) complete. We present several models of the extended calculus, involving for example meta-theoretical properties in categorical logic (gluing), probabilistic, and quantum computation. As a concrete application, we illustrate how a probabilistic model, based on Banach spaces, can be synergistically used with the calculus' equational system to reason about Cauchy sequences of random walks. This highlights the emergent shift from "program semantics as the science of program equivalence" to flexible, quantitative perspectives, involving functional analysis and beyond. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-07 in cs.LO). Categorie arXiv: Logic in Computer Science (cs.LO) ; Category Theory (math.CT). Pagina del lavoro: https://arxiv.org/abs/2608.06120 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T10:38:07.102Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).