Infinitary and regular proofs are commonly used in fixed point logics. Being natural
intermediate devices between semantics and traditional finitary proof systems, they are …

Bounded linear types have proved to be useful for automated resource analysis and control
in functional programming languages. In this paper we introduce a bounded linear ty** …

The subject of this thesis is the proof theory of logics with fixed points, such as the μ-
calculus, linear-logic with fixed points, etc. These logics are usually equipped with finitary …

Every known artificial deep neural network (DNN) corresponds to an object in a canonical
Grothendieck's topos; its learning dynamic corresponds to a flow of morphisms in this topos …

Quantum programming languages permit a hardware independent, high-level description of
quantum algorithms. In particular, the quantum λ-calculus is a higher-order language with …

Bayesian networks are graphical first-order probabilistic models that allow for a compact
representation of large probability distributions, and for efficient inference, both exact and …

Focusing, introduced by Jean-Marc Andreoli in the context of classical linear logic [Andreoli
1992], defines a normal form for sequent calculus derivations that cuts down on the number …

We consider the Curry-Howard-Lambek correspondence for effectful computation and
resource management, specifically proposing polarised calculi together with presheaf …

A dialogue category is a symmetric monoidal category equipped with a notion of tensorial
negation. We establish that the free dialogue category is a category of dialogue games and …

Many recent publications deal with trend analysis, event detection or opinion mining on
social media data. Twitter, as the most important microblogging service, is often in the focus …