| Publication | Date of Publication | Type |
|---|
| The Ackermann award 2023 | 2026-02-19 | Paper |
| A fresh inductive approach to useful call-by-value | 2026-01-21 | Paper |
| Meaningfulness and genericity in a subsuming framework (invited talk) | 2026-01-14 | Paper |
A quantitative approach to global state composition
Mathematical Structures in Computer Science | 2025-11-25 | Paper |
| Genericity through stratification | 2025-06-18 | Paper |
| Hybrid intersection types for PCF | 2025-02-19 | Paper |
| The benefits of diligence | 2025-01-31 | Paper |
A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
Logical Methods in Computer Science | 2024-09-04 | Paper |
A strong bisimulation for a classical term calculus
Logical Methods in Computer Science | 2024-06-27 | Paper |
| Rewriting with extensional polymorphic \(\lambda \)-calculus | 2024-06-21 | Paper |
| Solvability for generalized applications | 2024-05-27 | Paper |
Encoding tight typing in a unified framework
(available as arXiv preprint) | 2024-04-10 | Paper |
Node Replication: Theory And Practice
Logical Methods in Computer Science | 2024-03-11 | Paper |
Quantitative global memory
Logic, Language, Information, and Computation | 2024-02-28 | Paper |
A faithful and quantitative notion of distant reduction for generalized applications
Lecture Notes in Computer Science | 2024-01-23 | Paper |
scientific article; zbMATH DE number 7756108 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-27 | Paper |
The bang calculus revisited
Information and Computation | 2023-07-17 | Paper |
scientific article; zbMATH DE number 7650817 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)
Rewriting Techniques and Applications | 2022-12-09 | Paper |
| The spirit of node replication | 2021-10-18 | Paper |
The bang calculus revisited
(available as arXiv preprint) | 2021-07-06 | Paper |
Solvability = typability + inhabitation
(available as arXiv preprint) | 2021-03-26 | Paper |
| Solvability = typability + inhabitation | 2021-03-26 | Paper |
Consuming and persistent types for classical logic
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Tight typings and split bounds, fully developed
Journal of Functional Programming | 2020-09-09 | Paper |
| Normalisation for dynamic pattern calculi | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 7204443 (Why is no real title available?) | 2020-05-26 | Paper |
scientific article; zbMATH DE number 7155170 (Why is no real title available?)
(available as arXiv preprint) | 2020-01-22 | Paper |
Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
Automata, Languages and Programming | 2019-04-29 | Paper |
A confluent reduction for the extensional typed \(\lambda\)-calculus with pairs, sums, recursion and terminal object
Automata, Languages and Programming | 2019-03-29 | Paper |
Non-idempotent intersection types for the lambda-calculus
Logic Journal of the IGPL | 2019-01-08 | Paper |
A resource aware semantics for a focused intuitionistic calculus
Mathematical Structures in Computer Science | 2018-12-04 | Paper |
Inhabitation for non-idempotent intersection types
(available as arXiv preprint) | 2018-08-15 | Paper |
Call-by-need, neededness and all that
(available as arXiv preprint) | 2018-07-17 | Paper |
| Strong normalization through intersection types and memory | 2018-04-23 | Paper |
On abstract normalisation beyond neededness
Theoretical Computer Science | 2018-02-09 | Paper |
On abstract normalisation beyond neededness
Theoretical Computer Science | 2018-02-09 | Paper |
| Observability for Pair Pattern Calculi | 2017-07-12 | Paper |
| scientific article; zbMATH DE number 6707782 (Why is no real title available?) | 2017-04-25 | Paper |
\(\lambda\)-calculi with explicit substitutions and composition which preserve \(\beta\)-strong normalization
Algebraic and Logic Programming | 2017-01-19 | Paper |
Reasoning about call-by-need by means of types
Lecture Notes in Computer Science | 2016-06-10 | Paper |
A resource aware computational interpretation for Herbelin's syntax
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
The Inhabitation Problem for Non-idempotent Intersection Types
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Quantitative types for the linear substitution calculus
Lecture Notes in Computer Science | 2014-09-15 | Paper |
A nonstandard standardization theorem
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
The permutative \(\lambda \)-calculus
Logic for Programming, Artificial Intelligence, and Reasoning | 2012-06-15 | Paper |
Preservation of strong normalisation modulo permutations for the structural \(\lambda\)-calculus
Logical Methods in Computer Science | 2012-04-03 | Paper |
A prismoid framework for languages with resources
Theoretical Computer Science | 2011-12-23 | Paper |
The structural \(\lambda \)-calculus
Computer Science Logic | 2010-09-03 | Paper |
The Prismoid of Resources
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
A Theory of Explicit Substitutions with Safe and Full Composition
Logical Methods in Computer Science | 2009-08-20 | Paper |
First-class patterns
Journal of Functional Programming | 2009-03-25 | Paper |
Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic
Automated Reasoning | 2009-03-12 | Paper |
The Theory of Calculi with Explicit Substitutions Revisited
Computer Science Logic | 2009-03-05 | Paper |
Perpetuality for Full and Safe Composition (in a Constructive Setting)
Automata, Languages and Programming | 2008-08-19 | Paper |
Expression reduction systems with patterns
Journal of Automated Reasoning | 2008-01-22 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Resource operators for \(\lambda\)-calculus
Information and Computation | 2007-04-16 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Relating Higher-order and First-order Rewriting
Journal Of Logic And Computation | 2006-02-21 | Paper |
de Bruijn Indices for Metaterms
Journal Of Logic And Computation | 2006-02-21 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Pattern matching as cut elimination
Theoretical Computer Science | 2004-10-01 | Paper |
Proof nets and explicit substitutions
Mathematical Structures in Computer Science | 2004-09-07 | Paper |
| scientific article; zbMATH DE number 2043524 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 1761899 (Why is no real title available?) | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1722698 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1615230 (Why is no real title available?) | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1512610 (Why is no real title available?) | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1508928 (Why is no real title available?) | 2000-09-18 | Paper |
Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1348462 (Why is no real title available?) | 1999-10-07 | Paper |
| scientific article; zbMATH DE number 1332635 (Why is no real title available?) | 1999-09-08 | Paper |
\(\lambda\)-calculi with explicit substitutions preserving strong normalization
Applicable Algebra in Engineering, Communication and Computing | 1999-06-02 | Paper |
| scientific article; zbMATH DE number 1222417 (Why is no real title available?) | 1998-11-11 | Paper |
Combining algebraic rewriting, extensional lambda calculi, and fixpoints
Theoretical Computer Science | 1997-02-27 | Paper |
A typed pattern calculus
Information and Computation | 1996-03-27 | Paper |
Simulating expansions without expansions
Mathematical Structures in Computer Science | 1996-02-18 | Paper |
| scientific article; zbMATH DE number 176147 (Why is no real title available?) | 1993-05-18 | Paper |
