| Publication | Date of Publication | Type |
|---|
| A toy model provably featuring an arrow of time without past hypothesis | 2024-11-13 | Paper |
| From rewrite rules to axioms in the \(\lambda \varPi \)-calculus modulo theory | 2024-10-30 | Paper |
| Theoretical computer science: computability, decidability and logic | 2024-09-11 | Paper |
| Theoretical computer science: computational complexity | 2024-09-11 | Paper |
| Linear lambda-calculus is linear | 2024-05-27 | Paper |
Extensional proofs in a propositional logic modulo isomorphisms
Theoretical Computer Science | 2023-10-17 | Paper |
| Some Axioms for Mathematics | 2023-06-23 | Paper |
| A toy model provably featuring an arrow of time without past hypothesis | 2023-06-12 | Paper |
A new connective in natural deduction, and its application to quantum computing
Theoretical Computer Science | 2023-04-27 | Paper |
A modular construction of type theories
Logical Methods in Computer Science | 2023-03-22 | Paper |
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs
Mathematical Structures in Computer Science | 2023-02-28 | Paper |
Typing Quantum Superpositions and Measurement
Theory and Practice of Natural Computing | 2022-12-09 | Paper |
| From the universality of mathematical truth to the interoperability of proof systems | 2022-12-07 | Paper |
scientific article; zbMATH DE number 7559280 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
A new connective in natural deduction, and its application to quantum computing
Theoretical Aspects of Computing – ICTAC 2021 | 2022-03-31 | Paper |
| Free fall and cellular automata | 2021-12-02 | Paper |
Free fall and cellular automata
(available as arXiv preprint) | 2021-12-02 | Paper |
| The probability of non-confluent systems | 2021-06-22 | Paper |
The probability of non-confluent systems
(available as arXiv preprint) | 2021-06-22 | Paper |
| scientific article; zbMATH DE number 7356679 (Why is no real title available?) | 2021-06-08 | Paper |
scientific article; zbMATH DE number 7356679 (Why is no real title available?)
(available as arXiv preprint) | 2021-06-08 | Paper |
| Rewriting logic semantics of a plan execution language | 2021-02-09 | Paper |
| scientific article; zbMATH DE number 7251961 (Why is no real title available?) | 2020-09-27 | Paper |
scientific article; zbMATH DE number 7204561 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-27 | Paper |
scientific article; zbMATH DE number 7178363 (Why is no real title available?)
(available as arXiv preprint) | 2020-03-09 | Paper |
| The age of algorithms. Translated from the French by K-Rae Nelson | 2019-12-17 | Paper |
scientific article; zbMATH DE number 7034428 (Why is no real title available?)
(available as arXiv preprint) | 2019-03-11 | Paper |
scientific article; zbMATH DE number 6712184 (Why is no real title available?)
(available as arXiv preprint) | 2017-05-08 | Paper |
| scientific article; zbMATH DE number 6708664 (Why is no real title available?) | 2017-04-27 | Paper |
A Completion Method to Decide Reachability in Rewrite Systems
Frontiers of Combining Systems | 2017-02-27 | Paper |
| Yet another bijection between sequent calculus and natural deduction | 2016-08-01 | Paper |
| A calculus for automatic verification of Petri nets based on resolution and dynamic logics | 2016-08-01 | Paper |
The physical Church thesis as an explanation of the Galileo thesis
Natural Computing | 2016-07-08 | Paper |
Universality in two dimensions
Journal of Logic and Computation | 2016-04-28 | Paper |
| Logic | 2016-01-19 | Paper |
Decidability, introduction rules and automata
Logic for Programming, Artificial Intelligence, and Reasoning | 2016-01-12 | Paper |
Permissive-nominal logic: first-order logic over nominal terms and sets
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
The physical Church-Turing thesis and non-deterministic computation over the real numbers
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2015-08-21 | Paper |
| Computation, proof, machine. Mathematics enters a new age. Translated from the French by Pierre Guillot and Marion Roman | 2015-03-27 | Paper |
| scientific article; zbMATH DE number 6288796 (Why is no real title available?) | 2014-04-25 | Paper |
On the convergence of reduction-based and model-based methods in proof theory
Electronic Notes in Theoretical Computer Science | 2013-12-13 | Paper |
| A computational definition of the notion of vectorial space | 2013-09-20 | Paper |
Real numbers, chaos, and the principle of a bounded density of information
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Causal graph dynamics
Information and Computation | 2013-06-06 | Paper |
Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic
Electronic Notes in Theoretical Computer Science | 2013-06-06 | Paper |
The physical Church-Turing thesis and the principles of quantum theory
International Journal of Foundations of Computer Science | 2013-01-18 | Paper |
A simple proof that super-consistency implies cut elimination
Notre Dame Journal of Formal Logic | 2012-11-29 | Paper |
Causal Graph Dynamics
Automata, Languages, and Programming | 2012-11-01 | Paper |
A theory independent Curry-De Bruijn-Howard correspondence
Automata, Languages, and Programming | 2012-11-01 | Paper |
PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science | 2012-10-11 | Paper |
Provably correct conflict prevention bands algorithms
Science of Computer Programming | 2012-07-20 | Paper |
Around the physical Church-Turing thesis: cellular automata, formal languages, and the principles of quantum theory
Language and Automata Theory and Applications | 2012-06-08 | Paper |
A formal library of set relations and its application to synchronous languages
Theoretical Computer Science | 2011-12-23 | Paper |
On the expressive power of schemes
Information and Computation | 2011-10-10 | Paper |
| Skolemization in simple type theory: the logical and the theoretical points of view | 2011-03-30 | Paper |
| scientific article; zbMATH DE number 5869468 (Why is no real title available?) | 2011-03-23 | Paper |
Proofs and algorithms. An introduction to logic and computability
Undergraduate Topics in Computer Science | 2011-02-15 | Paper |
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
Logic Journal of the IGPL | 2010-12-14 | Paper |
Polarized Resolution Modulo
IFIP Advances in Information and Communication Technology | 2010-10-27 | Paper |
Introduction to the theory of programming languages.
Undergraduate Topics in Computer Science | 2010-10-13 | Paper |
On the completeness of quantum computation models
Programs, Proofs, Processes | 2010-07-29 | Paper |
| scientific article; zbMATH DE number 5728682 (Why is no real title available?) | 2010-06-29 | Paper |
| scientific article; zbMATH DE number 5728681 (Why is no real title available?) | 2010-06-29 | Paper |
On the convergence of reduction-based and model-based methods in proof theory
Logic Journal of the IGPL | 2009-11-12 | Paper |
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
Lecture Notes in Computer Science | 2009-03-10 | Paper |
Truth Values Algebras and Proof Normalization
Lecture Notes in Computer Science | 2009-03-10 | Paper |
| The metamorphoses of the calculus. An amazing history of mathematics | 2008-11-10 | Paper |
Principles of programming languages
Undergraduate Topics in Computer Science | 2008-10-02 | Paper |
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
Rewriting Techniques and Applications | 2008-08-28 | Paper |
| Type theory and proof processing systems | 2008-02-08 | Paper |
| Introduction to proof theory | 2008-01-14 | Paper |
A Simple Proof That Super-Consistency Implies Cut Elimination
Lecture Notes in Computer Science | 2008-01-02 | Paper |
Automated Deduction – CADE-20
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Eigenvariables, bracketing and the decidability of positive minimal predicate logic
Theoretical Computer Science | 2006-09-14 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
| scientific article; zbMATH DE number 2185659 (Why is no real title available?) | 2005-07-04 | Paper |
Proof normalization modulo
Journal of Symbolic Logic | 2005-02-09 | Paper |
Proof normalization modulo
Journal of Symbolic Logic | 2005-02-09 | Paper |
| scientific article; zbMATH DE number 2086373 (Why is no real title available?) | 2004-08-11 | Paper |
Theorem proving modulo
Journal of Automated Reasoning | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 2043517 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 1980922 (Why is no real title available?) | 2003-09-15 | Paper |
Higher order unification via explicit substitutions
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1852171 (Why is no real title available?) | 2003-01-09 | Paper |
| scientific article; zbMATH DE number 1808201 (Why is no real title available?) | 2002-09-30 | Paper |
| Higher-order unification and matching | 2002-08-27 | Paper |
About folding-unfolding cuts and cuts modulo
Journal of Logic and Computation | 2002-06-06 | Paper |
HOL-\(\lambda\sigma\): An intentional first-order expression of higher-order logic
MSCS. Mathematical Structures in Computer Science | 2001-11-13 | Paper |
| scientific article; zbMATH DE number 1538009 (Why is no real title available?) | 2000-12-03 | Paper |
| scientific article; zbMATH DE number 1420786 (Why is no real title available?) | 2000-09-20 | Paper |
| scientific article; zbMATH DE number 1507179 (Why is no real title available?) | 2000-09-14 | Paper |
Collections, sets and types
Mathematical Structures in Computer Science | 2000-06-13 | Paper |
| scientific article; zbMATH DE number 1405633 (Why is no real title available?) | 2000-04-25 | Paper |
| scientific article; zbMATH DE number 1301732 (Why is no real title available?) | 1999-06-16 | Paper |
| scientific article; zbMATH DE number 1082077 (Why is no real title available?) | 1999-02-02 | Paper |
| scientific article; zbMATH DE number 863013 (Why is no real title available?) | 1996-04-02 | Paper |
Third order matching is decidable
Annals of Pure and Applied Logic | 1994-11-08 | Paper |
| scientific article; zbMATH DE number 626035 (Why is no real title available?) | 1994-10-23 | Paper |
A Complete Proof Synthesis Method for the Cube of Type Systems
Journal Of Logic And Computation | 1994-06-20 | Paper |
| scientific article; zbMATH DE number 512777 (Why is no real title available?) | 1994-06-09 | Paper |
| scientific article; zbMATH DE number 176135 (Why is no real title available?) | 1993-05-18 | Paper |
The undecidability of pattern matching in calculi where primitive recursive functions are representable
Theoretical Computer Science | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 29189 (Why is no real title available?) | 1992-06-27 | Paper |
A linear proof language for second-order intuitionistic linear logic
(available as arXiv preprint) | N/A | Paper |
