#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2012

2018

- This year (4)
- Last 5 years (14)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

Effects and coeffects are two general, complementary aspects of program behaviour. They roughly correspond to computations which change the execution context (effects) versus computations which make… (More)

- Flavien Breuvart, Ugo Dal Lago, Agathe Herrou
- ArXiv
- 2017

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 T with various forms… (More)

- Flavien Breuvart
- CSL-LICS
- 2014

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 theory is H*. An… (More)

- Flavien Breuvart
- TLCA
- 2013

Relational semantics is one of the simplest and categorically most natural semantics of Linear Logic. The co-Kleisli category MRel associated with its multiset exponential comonad contains a fully… (More)

- Flavien Breuvart, Michele Pagani
- CSL
- 2015

Various typing system have been recently introduced giving a parametric version of the exponential modality of linear logic, e.g. [6, 2]. The parameters are taken from a semi-ring, and allow to… (More)

- Flavien Breuvart, Ugo Dal Lago
- PPDP
- 2018

We define two intersection type systems for the pure, untyped, probabilistic λ-calculus, and prove that type derivations precisely reflect the probability of convergence of the underlying term. We… (More)

- Flavien Breuvart
- Logical Methods in Computer Science
- 2016

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 theory is H∗… (More)

- Flavien Breuvart, Giulio Manzonetto, Domenico Ruoppolo
- Logical Methods in Computer Science
- 2018

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 there exists a minimal… (More)