| Publication | Date of Publication | Type |
|---|
Holonomic equations and efficient random generation of binary trees
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
| Structural rules and resource control in logic and computation | 2023-07-21 | Paper |
Almost all Classical Theorems are Intuitionistic
RAIRO - Theoretical Informatics and Applications | 2023-01-23 | Paper |
Explicit substitutions with de bruijn's levels
Rewriting Techniques and Applications | 2022-12-09 | Paper |
| L-types for resource awareness: an implicit name approach | 2021-12-21 | Paper |
| Counting environments and closures | 2021-06-15 | Paper |
Almost all classical theorems are intuitionistic
(available as arXiv preprint) | 2021-04-14 | Paper |
| Extensive Infinite Games and Escalation, an exercise in Agda | 2020-06-19 | Paper |
On the enumeration of closures and environments with an application to random generation
(available as arXiv preprint) | 2019-11-26 | Paper |
Dependent Types for Extensive Games
(available as arXiv preprint) | 2019-09-18 | Paper |
Combinatorics of \(\lambda\)-terms: a natural approach
Journal Of Logic And Computation | 2018-11-20 | Paper |
Quantitative Aspects of Linear and Affine Closed Lambda Terms
ACM Transactions on Computational Logic | 2018-08-20 | Paper |
| Combinatorics of explicit substitutions | 2018-04-11 | Paper |
Counting and generating terms in the binary lambda calculus
Journal of Functional Programming | 2017-10-23 | Paper |
A natural counting of lambda terms
Lecture Notes in Computer Science | 2016-03-10 | Paper |
| Counting terms in the binary lambda calculus | 2016-03-01 | Paper |
Counting terms in the binary lambda calculus
(available as arXiv preprint) | 2016-03-01 | Paper |
| Resource control and intersection types: an intrinsic connection | 2014-12-06 | Paper |
On semantics of a term calculus for classical logic
Publications de l'Institut Mathématique. Nouvelle Série | 2014-11-14 | Paper |
On semantics of a term calculus for classical logic
Publications de l'Institut Math?matique (Belgrade) | 2014-11-14 | Paper |
Counting and generating lambda terms
Journal of Functional Programming | 2014-02-27 | Paper |
| Intersection and union types in the \(\bar{\lambda}\mu\tilde{\mu}\)-calculus | 2013-10-02 | Paper |
| Addressed term rewriting systems: syntax, semantics, and pragmatics (extended abstract) | 2013-09-25 | Paper |
A simple case of rationality of escalation
Algebra and Coalgebra in Computer Science | 2013-09-13 | Paper |
| A journey through resource control lambda calculi and explicit substitution using intersection types (an account) | 2013-06-10 | Paper |
Common knowledge logic in a higher order proof assistant
Programming Logics | 2013-04-19 | Paper |
On counting untyped lambda terms
Theoretical Computer Science | 2013-03-27 | Paper |
``Backward coinduction, Nash equilibrium and the rationality of escalation
Acta Informatica | 2012-10-15 | Paper |
| Computational interpretation of classical logic with explicit structural rules | 2012-03-21 | Paper |
Intersection types for the resource control lambda calculi
Theoretical Aspects of Computing – ICTAC 2011 | 2012-01-06 | Paper |
| Resource control and strong normalisation | 2011-12-15 | Paper |
Intuitionistic sequent-style calculus with explicit structural rules
Logic, Language, and Computation | 2011-07-29 | Paper |
Computation with classical sequents
Mathematical Structures in Computer Science | 2008-08-15 | Paper |
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
Theoretical Computer Science | 2008-06-24 | Paper |
Strong Normalization of the Dual Classical Sequent Calculus
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Mechanizing common knowledge logic using COQ
Annals of Mathematics and Artificial Intelligence | 2007-08-23 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science | 2006-08-28 | Paper |
Types for Proofs and Programs
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Intersection types for explicit substitutions
Information and Computation | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 1988961 (Why is no real title available?) | 2003-10-20 | Paper |
Reductions, intersection types, and explicit substitutions
Mathematical Structures in Computer Science | 2003-06-23 | Paper |
| scientific article; zbMATH DE number 1722651 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1508933 (Why is no real title available?) | 2000-09-18 | Paper |
| scientific article; zbMATH DE number 1348481 (Why is no real title available?) | 1999-10-10 | Paper |
λν, a calculus of explicit substitutions which preserves strong normalisation
Journal of Functional Programming | 1997-04-29 | Paper |
Valentin Antimirov (1961--1995)
Theoretical Computer Science | 1997-02-27 | Paper |
Termination of rewrite systems by elementary interpretations
Formal Aspects of Computing | 1995-05-11 | Paper |
On termination of one rule rewrite systems
Theoretical Computer Science | 1994-09-25 | Paper |
Algebraic and logic programming. International workshop, Gaussig, GDR, November 14-18, 1988. Proceedings
Lecture Notes in Computer Science | 1993-06-05 | Paper |
| scientific article; zbMATH DE number 176122 (Why is no real title available?) | 1993-05-18 | Paper |
Well rewrite orderings and well quasi-orderings
Journal of Symbolic Computation | 1993-05-16 | Paper |
The term rewriting approach to automated theorem proving
The Journal of Logic Programming | 1992-11-10 | Paper |
Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
Information and Computation | 1990-01-01 | Paper |
Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
Information and Computation | 1990-01-01 | Paper |
On the recursive decomposition ordering with lexicographical status and other related orderings
Journal of Automated Reasoning | 1990-01-01 | Paper |
Termination by completion
Applicable Algebra in Engineering, Communication and Computing | 1990-01-01 | Paper |
Equational problems and disunification
Journal of Symbolic Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4170966 (Why is no real title available?) | 1989-01-01 | Paper |
Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4007716 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4047066 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4047067 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3921947 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3870642 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3870584 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3817023 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3810909 (Why is no real title available?) | 1983-01-01 | Paper |
Behavioural Categoricity of Abstract Data Type Specifications
The Computer Journal | 1983-01-01 | Paper |
On multiset orderings
Information Processing Letters | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3772918 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3821100 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3810907 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3727602 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3635469 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3765865 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3587097 (Why is no real title available?) | 1977-01-01 | Paper |
An exercise on streams: convergence acceleration
(available as arXiv preprint) | N/A | Paper |
