Syntax and semantics of focalisation with relative monads and comonads

📅 2026-06-12
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the focused syntax and semantic modeling of resource modality (!) and effect modality (◇) in intuitionistic and linear logics. By working within a non-associative categorical framework of linear call-by-push-value, it introduces relative comonads and relative monads with respect to positive and negative shift functors, thereby establishing—for the first time—a direct connection between the proof-theoretic structure of focused calculi and the theory of relative (co)monads. This approach uniformly treats both modalities, yields a complete semantic model, and reveals a correspondence between relative (co)monads and adjoint structures over non-associative categories, offering a novel categorical semantic foundation for polarized and focused logics.
📝 Abstract
The logical principles of focalisation and polarisation can be used to design well-behaved term syntaxes for sequent calculus, which play a role as meta-languages for describing effectful computation. On the semantics side, this corresponds to an axiomatic and polarised notion of model of computation stated in terms of adjunctions over non-associative categories. In this paper, we study the special and delicate cases of resource and effect modalities in a general intuitionistic and linear setting: an exponential comonad $!$ (refining $\square$) and a strong monad $\lozenge$. The starting point of our contribution is noticing that the completeness for a polarised syntax for $!$ and $\lozenge$ with respect to (co)monads in linear call-by-push-value models can be achieved if we move to relative (co)monads: more precisely, comonads relative to $\downarrow$ (the positive shift functor) for $!$ and monads relative to $\uparrow$ (the negative shift functor) for $\lozenge$. These specialisations of the concept of relative (co)monad to call-by-push-value adjunctions recently appeared. Yet the syntax we present arose from proof-theoretic consideration, without the link with relative (co)monads being noticed at the time. Our first remark is thus that (co)monads relative to a call-by-push-value adjunction have been motivated previously from a proof-theoretic perspective in the context of focalisation, which also provides a meta-language for these concepts in an effectful setting. We carry out the study of these modalities from the axiomatic, non-associative point of view. We recall the notion of adjunction over non-associative categories, and establish correspondence results between this notion of adjunction and that of relative adjunction. This correspondence is then extended to linear-non-linear and strong versions of adjunctions as needed to model $!$ and $\lozenge$.
Problem

Research questions and friction points this paper is trying to address.

focalisation
relative monads
relative comonads
linear logic
call-by-push-value
Innovation

Methods, ideas, or system contributions that make the work stand out.

relative comonads
focalisation
call-by-push-value
linear logic
polarised semantics
🔎 Similar Papers
2022-12-16International Conference on Formal Structures for Computation and DeductionCitations: 3