| Publication | Date of Publication | Type |
|---|
| Categorifying non-idempotent intersection types | 2026-03-23 | Paper |
| A deep quantitative type system | 2026-03-23 | Paper |
| Factorize factorization (edit) | 2026-03-23 | Paper |
| Infinitary cut-elimination via finite approximations | 2026-02-19 | Paper |
| Meaningfulness and genericity in a subsuming framework (invited talk) | 2026-01-14 | Paper |
| Genericity through stratification | 2025-06-18 | Paper |
| A deep inference system for differential linear logic | 2025-01-06 | Paper |
| Strong call-by-value and multi types | 2024-09-13 | Paper |
| Strategies for asymptotic normalization | 2024-05-27 | Paper |
| Factorization and normalization, essentially | 2024-04-19 | Paper |
Types by need
Programming Languages and Systems | 2023-11-24 | Paper |
Types of fireballs
Programming Languages and Systems | 2023-08-02 | Paper |
On reduction and normalization in the computational core
Mathematical Structures in Computer Science | 2023-02-28 | Paper |
| Glueability of resource proof-structures: inverting the Taylor expansion | 2023-02-07 | Paper |
Implementing open call-by-value
(available as arXiv preprint) | 2022-11-04 | Paper |
scientific article; zbMATH DE number 7566060 (Why is no real title available?)
(available as arXiv preprint) | 2022-08-02 | Paper |
| scientific article; zbMATH DE number 7566060 (Why is no real title available?) | 2022-08-02 | Paper |
| scientific article; zbMATH DE number 7526055 (Why is no real title available?) | 2022-05-12 | Paper |
scientific article; zbMATH DE number 7526055 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-12 | Paper |
| The bang calculus and the two Girard's translations | 2021-12-20 | Paper |
The bang calculus and the two Girard's translations
(available as arXiv preprint) | 2021-12-20 | Paper |
Factorization in call-by-name and call-by-value calculi via linear logic
(available as arXiv preprint) | 2021-10-18 | Paper |
| The problem of harmony in classical logic | 2021-02-06 | Paper |
Decomposing probabilistic lambda calculi
(available as arXiv preprint) | 2020-09-23 | Paper |
Gluing resource proof-structures: inhabitation and inverting the Taylor expansion
(available as arXiv preprint) | 2020-08-06 | Paper |
| Proof-net as graph, Taylor expansion as pullback | 2020-03-04 | Paper |
| Head reduction and normalization in a call-by-value lambda-calculus | 2019-10-24 | Paper |
| Glueability of resource proof-structures: inverting the Taylor expansion (long version) | 2019-10-17 | Paper |
Postponement of $\mathsf {raa}$ and Glivenko's theorem, revisited
Studia Logica | 2019-05-15 | Paper |
| Types by Need (Extended Version) | 2019-02-15 | Paper |
| Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (Long Version) | 2018-12-27 | Paper |
scientific article; zbMATH DE number 6825409 (Why is no real title available?)
(available as arXiv preprint) | 2018-01-12 | Paper |
| Postponement of raa and Glivenko's theorem, revisited (extended version) | 2017-10-24 | Paper |
| Computing connected proof(-structure)s from their Taylor expansion | 2017-10-17 | Paper |
| Standardization of a Call-By-Value Lambda-Calculus | 2017-07-12 | Paper |
Open call-by-value
Programming Languages and Systems | 2016-12-21 | Paper |
Open call-by-value
Programming Languages and Systems | 2016-12-21 | Paper |
A Semantical and Operational Account of Call-by-Value Solvability
Lecture Notes in Computer Science | 2014-04-16 | Paper |
