8 citations · 19 across the 11 of their papers we have counts for
11 papers
On the Centre of Strong Graded Monads
Flavien Breuvart, Quan Long, Vladimir Zamdzhiev
We introduce the notion of 'centre' for pomonoid-graded strong monads which generalizes some previous work that describes the centre of (not graded) strong monads. We show that, wh…
An Indexed Linear Logic for Idempotent Intersection Types (Long version)
Flavien Breuvart, Federico Olimpieri
Indexed Linear Logic has been introduced by Ehrhard and Bucciarelli, it can be seen as a logical presentation of non-idempotent intersection types extended through the relational s…
Unifying Graded Linear Logic and Differential Operators
Flavien Breuvart, Marie Kerjean, Simon Mirwasser
Linear Logic refines Intuitionnistic Logic by taking into account the resources used during the proof and program computation. In the past decades, it has been extended to various…
Canonical Gradings of Monads
Flavien Breuvart, Dylan McDermott, Tarmo Uustalu
We define a notion of grading of a monoid T in a monoidal category C, relative to a class of morphisms M (which provide a notion of M-subobject). We show that, under reasonable con…
Reflection on the enrichment of double categories
Flavien Breuvart
Enrichment and internal categories are two different way to generalize the notion of category. As such, enriching double categories (which are categories internal to Cat) is not a…
Refining Properties of Filter Models: Sensibility, Approximability and Reducibility
Flavien Breuvart
In this paper, we study the tedious link between the properties of sensibility and approximability of models of untyped λ-calculus. Approximability is known to be a slightly, but s…
On the characterization of models of H* : The operational aspect
Flavien Breuvart
We give a characterization, with respect to a large class of models of untyped -calculus, of those models that are fully abstract for head-normalization, i.e., whose equational…
Relational Graph Models at Work
Flavien Breuvart, Giulio Manzonetto, Domenico Ruoppolo
We study the relational graph models that constitute a natural subclass of relational models of lambda-calculus. We prove that among the lambda-theories induced by such models ther…
On Higher-Order Probabilistic Subrecursion
Flavien Breuvart, Ugo Dal Lago, Agathe Herrou
We study the expressive power of subrecursive probabilistic higher-order calculi. More specifically, we show that endowing a very expressive deterministic calculus like Gödel's $\m…
On the characterization of models of H*: The semantical aspect
Flavien Breuvart
We give a characterization, with respect to a large class of models of untyped lambda-calculus, of those models that are fully abstract for head-normalization, i.e., whose equation…
On the discriminating power of tests in resource lambda-calculus
Flavien Breuvart
Since its discovery, differential linear logic (DLL) inspired numerous domains. In denotational semantics, categorical models of DLL are now commune, and the simplest one is Rel, t…