| Publication | Date of Publication | Type |
|---|
| Towards a characterization of two-way bijections in a reversible computational model | 2025-11-14 | Paper |
Termination of rewriting on reversible Boolean circuits as a free 3-category problem
Theoretical Computer Science | 2025-01-16 | Paper |
| Algorithmically expressive, always-terminating model for reversible computation | 2024-11-13 | Paper |
Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean}
Journal of Logical and Algebraic Methods in Programming | 2024-02-12 | Paper |
Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}
(available as arXiv preprint) | 2022-11-11 | Paper |
| Quantum programming made easy | 2021-12-20 | Paper |
Quantum programming made easy
(available as arXiv preprint) | 2021-12-20 | Paper |
Splitting Recursion Schemes into Reversible and Classical Interacting Threads
Reversible Computation | 2021-11-03 | Paper |
| On the expressivity of total reversible programming languages | 2021-07-05 | Paper |
A type-assignment of linear erasure and duplication
Theoretical Computer Science | 2020-08-25 | Paper |
The fixed point problem of a simple reversible language
Theoretical Computer Science | 2020-04-21 | Paper |
A class of recursive permutations which is primitive recursive complete
Theoretical Computer Science | 2020-04-21 | Paper |
| A certified study of a reversible programming language | 2018-08-13 | Paper |
Intuitionistic light affine logic
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
| A class of reversible primitive recursive functions | 2016-08-05 | Paper |
A deep inference system with a self-dual binder which is complete for linear lambda calculus
Journal Of Logic And Computation | 2016-07-07 | Paper |
Can a light typing discipline be compatible with an efficient implementation of finite fields inversion?
Foundational and Practical Aspects of Resource Analysis | 2016-01-07 | Paper |
Light affine logic as a programming language: a first contribution
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Intersection types from a proof-theoretic perspective
Fundamenta Informaticae | 2013-01-24 | Paper |
Typing a core binary-field arithmetic in a light logic
Foundational and Practical Aspects of Resource Analysis | 2012-11-02 | Paper |
Linear lambda calculus and deep inference
Lecture Notes in Computer Science | 2011-06-17 | Paper |
A Local Criterion for Polynomial-Time Stratified Computations
Foundational and Practical Aspects of Resource Analysis | 2010-09-14 | Paper |
A By-Level Analysis of Multiplicative Exponential Linear Logic
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets
Lecture Notes in Computer Science | 2009-07-02 | Paper |
Taming Modal Impredicativity: Superlazy Reduction
Logical Foundations of Computer Science | 2009-02-24 | Paper |
Types for Proofs and Programs
Lecture Notes in Computer Science | 2005-12-23 | Paper |
| scientific article; zbMATH DE number 2185674 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 1841834 (Why is no real title available?) | 2002-12-04 | Paper |
The call-by-value λ-calculus: a semantic investigation
Mathematical Structures in Computer Science | 2000-05-17 | Paper |
| scientific article; zbMATH DE number 1424054 (Why is no real title available?) | 2000-03-23 | Paper |
| scientific article; zbMATH DE number 1302629 (Why is no real title available?) | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1086680 (Why is no real title available?) | 1998-05-17 | Paper |
Lambda calculus and intuitionistic linear logic
Studia Logica | 1998-02-11 | Paper |
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem
(available as arXiv preprint) | N/A | Paper |
