| Publication | Date of Publication | Type |
|---|
| The sum-product algorithm for quantitative multiplicative linear logic | 2024-10-21 | Paper |
| scientific article; zbMATH DE number 7559292 (Why is no real title available?) | 2022-07-18 | Paper |
The Benefit of Being Non-Lazy in Probabilistic λ-calculus
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | 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 |
| Strong adequacy and untyped full-abstraction for probabilistic coherence spaces | 2020-01-28 | Paper |
New semantical insights into call-by-value \(\lambda\)-calculus
Fundamenta Informaticae | 2020-01-24 | Paper |
Full abstraction for probabilistic PCF
Journal of the ACM | 2018-12-06 | Paper |
The conservation theorem for differential nets
Mathematical Structures in Computer Science | 2017-09-28 | Paper |
| Modelling coeffects in the relational semantics of linear logic | 2017-08-31 | Paper |
Weighted relational models of typed lambda-calculi
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
The free exponential modality of probabilistic coherence spaces
Lecture Notes in Computer Science | 2017-05-19 | Paper |
| A characterization of the Taylor expansion of -terms | 2017-02-02 | Paper |
Strong normalizability as a finiteness structure via the Taylor expansion of -terms
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Call-by-value non-determinism in a linear logic type discipline
Logical Foundations of Computer Science | 2015-12-11 | Paper |
Applying quantitative semantics to higher-order quantum computing
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
Probabilistic coherence spaces are fully abstract for probabilistic PCF
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
Visible acyclic differential nets. I: Semantics
Annals of Pure and Applied Logic | 2012-04-13 | Paper |
Böhm's theorem for resource lambda calculus through Taylor expansion
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Linearity, non-determinism and solvability
Fundamenta Informaticae | 2011-05-18 | Paper |
A semantic measure of the execution time in linear logic
Theoretical Computer Science | 2011-05-10 | Paper |
Solvability in resource lambda-calculus
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
Strong normalization property for second order linear logic
Theoretical Computer Science | 2009-12-15 | Paper |
The Cut-Elimination Theorem for Differential Nets with Promotion
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Acyclicity and Coherence in Multiplicative Exponential Linear Logic
Computer Science Logic | 2009-03-12 | Paper |
The Separation Theorem for Differential Interaction Nets
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
Mathematical Structures in Computer Science | 2007-06-04 | Paper |
