A core quantitative coeffect calculus

A Brunel, M Gaboardi, D Mazza… - European Symposium on …, 2014 - Springer
Linear logic is well known for its resource-awareness, which has inspired the design of
several resource management mechanisms in programming language design. Its resource …

A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed-points

A Saurin - … Conference on Automated Reasoning with Analytic …, 2023 - Springer
This paper establishes cut-elimination for, and, that are non-wellfounded sequent calculi
with least and greatest fixed-points, by expanding on prior works by Santocanale and Fortier …

Applying quantitative semantics to higher-order quantum computing

M Pagani, P Selinger, B Valiron - Proceedings of the 41st ACM SIGPLAN …, 2014 - dl.acm.org
Finding a denotational semantics for higher order quantum computation is a long-standing
problem in the semantics of quantum programming languages. Most past approaches to this …

Weighted relational models of typed lambda-calculi

J Laird, G Manzonetto, G McCusker… - 2013 28th Annual …, 2013 - ieeexplore.ieee.org
The category Rel of sets and relations yields one of the simplest denotational semantics of
Linear Logic (LL). It is known that Rel is the biproduct completion of the Boolean ring. We …

An introduction to differential linear logic: proof-nets, models and antiderivatives

T Ehrhard - Mathematical Structures in Computer Science, 2018 - cambridge.org
Differential linear logic enriches linear logic with additional logical rules for the exponential
connectives, dual to the usual rules of dereliction, weakening and contraction. We present a …

An introduction to string diagrams for computer scientists

R Piedeleu, F Zanasi - arXiv preprint arXiv:2305.08768, 2023 - arxiv.org
This document is an elementary introduction to string diagrams. It takes a computer science
perspective: rather than using category theory as a starting point, we build on intuitions from …

Semantics of higher-order probabilistic programs with conditioning

F Dahlqvist, D Kozen - Proceedings of the ACM on Programming …, 2019 - dl.acm.org
We present a denotational semantics for higher-order probabilistic programs in terms of
linear operators between Banach spaces. Our semantics is rooted in the classical theory of …

Polygraphs: from rewriting to higher categories

D Ara, A Burroni, Y Guiraud, P Malbos… - arXiv preprint arXiv …, 2023 - arxiv.org
Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based
on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting …

[PDF][PDF] Collapsing non-idempotent intersection types

T Ehrhard - Computer Science Logic (CSL'12)-26th International …, 2012 - drops.dagstuhl.de
We proved recently that the extensional collapse of the relational model of linear logic
coincides with its Scott model, whose objects are preorders and morphisms are downwards …

Taylor expansion as a monad in models of dill

M Kerjean, JSP Lemay - … 38th Annual ACM/IEEE Symposium on …, 2023 - ieeexplore.ieee.org
Differential Linear Logic (DiLL) adds to Linear Logic (LL) a symmetrization of three out of the
four exponential rules, which allows the expression of a natural notion of differentiation. In …