| Publication | Date of Publication | Type |
|---|
| Extended addressing machines for PCF, with explicit substitutions | 2026-04-02 | Paper |
A fully abstract model of PCF based on extended addressing machines
Logical Methods in Computer Science | 2025-09-25 | Paper |
| A lambda calculus satellite | 2024-10-21 | Paper |
A lambda calculus satellite
Studies in Logic (London) | 2024-03-01 | Paper |
| Call-By-Value, Again! | 2023-06-23 | Paper |
scientific article; zbMATH DE number 7577574 (Why is no real title available?)
(available as arXiv preprint) | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7577574 (Why is no real title available?) | 2022-08-30 | 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 |
scientific article; zbMATH DE number 7226008 (Why is no real title available?)
(available as arXiv preprint) | 2020-07-30 | Paper |
| scientific article; zbMATH DE number 7226008 (Why is no real title available?) | 2020-07-30 | Paper |
| scientific article; zbMATH DE number 7204439 (Why is no real title available?) | 2020-05-26 | Paper |
The fixed point property and a technique to harness double fixed point combinators
Journal Of Logic And Computation | 2020-02-03 | Paper |
New semantical insights into call-by-value \(\lambda\)-calculus
Fundamenta Informaticae | 2020-01-24 | Paper |
Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
(available as arXiv preprint) | 2019-02-25 | Paper |
Relational graph models at work
(available as arXiv preprint) | 2018-08-15 | Paper |
Factor varieties and symbolic computation
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| New results on Morris's observational theory: the benefits of separating the inseparable | 2017-10-17 | Paper |
Weighted relational models of typed lambda-calculi
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Categorical models for simply typed resource calculi
Electronic Notes in Theoretical Computer Science | 2016-07-08 | Paper |
| Relational graph models, Taylor expansion and extensionality | 2016-05-13 | Paper |
Call-by-value non-determinism in a linear logic type discipline
Logical Foundations of Computer Science | 2015-12-11 | Paper |
Constructing differential categories and deconstructing categories of games
Information and Computation | 2013-06-06 | Paper |
Loader and Urzyczyn are logically related
Automata, Languages, and Programming | 2012-11-01 | Paper |
Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
Logical Methods in Computer Science | 2012-10-22 | Paper |
| Full abstraction for resource calculus with tests | 2012-09-18 | Paper |
Full abstraction for resource calculus with tests
(available as arXiv preprint) | 2012-09-18 | Paper |
What is a categorical model of the differential and the resource \(\lambda \)-calculi?
MSCS. Mathematical Structures in Computer Science | 2012-06-04 | Paper |
A relational semantics for parallelism and non-determinism in a functional setting
Annals of Pure and Applied Logic | 2012-04-10 | Paper |
Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions
Theoretical Computer Science | 2012-03-13 | Paper |
Constructing Differential Categories and Deconstructing Categories of Games
Automata, Languages and Programming | 2011-07-07 | Paper |
Böhm's theorem for resource lambda calculus through Taylor expansion
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Harnessing \(\mathrm{ML}^{\mathrm F}\) with the power of system F
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Applying universal algebra to lambda calculus
Journal Of Logic And Computation | 2010-08-26 | Paper |
Effective λ-models versus recursively enumerable λ-theories
Mathematical Structures in Computer Science | 2009-11-11 | Paper |
A General Class of Models of $\mathcal{H}^*$
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Not Enough Points Is Enough
Computer Science Logic | 2009-03-05 | Paper |
Lambda Theories of Effective Lambda Models
Computer Science Logic | 2009-03-05 | Paper |
A Relational Model of a Parallel and Non-deterministic λ-Calculus
Logical Foundations of Computer Science | 2009-02-24 | Paper |
From λ-Calculus to Universal Algebra and Back
Lecture Notes in Computer Science | 2009-02-03 | Paper |
