Enriching a linear/non-linear lambda calculus: a programming language for string diagrams

From MaRDI portal
Publication:5145342

DOI10.1145/3209108.3209196zbMATH Open1454.03023arXiv1804.09822OpenAlexW4289760920MaRDI QIDQ5145342FDOQ5145342


Authors: Bert Lindenhovius, Vladimir Zamdzhiev, Michael Mislove Edit this on Wikidata


Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Abstract: Linear/non-linear (LNL) models, as described by Benton, soundly model a LNL term calculus and LNL logic closely related to intuitionistic linear logic. Every such model induces a canonical enrichment that we show soundly models a LNL lambda calculus for string diagrams, introduced by Rios and Selinger (with primary application in quantum computing). Our abstract treatment of this language leads to simpler concrete models compared to those presented so far. We also extend the language with general recursion and prove soundness. Finally, we present an adequacy result for the diagram-free fragment of the language which corresponds to a modified version of Benton and Wadler's adjoint calculus with recursion.


Full work available at URL: https://arxiv.org/abs/1804.09822




Recommendations





Cited In (12)

Uses Software





This page was built for publication: Enriching a linear/non-linear lambda calculus: a programming language for string diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145342)