| Publication | Date of Publication | Type |
|---|
| Higher-order constrained dependency pairs for (universal) computability | 2026-05-12 | Paper |
| Wanda -- a higher-order termination tool (system description) | 2026-02-24 | Paper |
A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
Logical Methods in Computer Science | 2026-02-13 | Paper |
| Certifying higher-order polynomial interpretations | 2024-11-26 | Paper |
| On basic feasible functionals and the interpretation method | 2024-10-30 | Paper |
| Cost-size semantics for call-by-value higher-order rewriting | 2024-10-21 | Paper |
| Cutting a proof into bite-sized chunks: incrementally proving termination in higher-order term rewriting (invited talk) | 2024-05-27 | Paper |
A static higher-order dependency pair framework
Programming Languages and Systems | 2023-11-24 | Paper |
Subclasses of \textsc{Ptime} interpreted by programming languages
Theory of Computing Systems | 2023-07-26 | Paper |
Tuple Interpretations for Higher-Order Complexity.
(available as arXiv preprint) | 2023-06-23 | Paper |
Polymorphic higher-order termination
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7453191 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-06 | Paper |
| scientific article; zbMATH DE number 7453191 (Why is no real title available?) | 2022-01-06 | Paper |
Polynomial interpretations for higher-order rewriting
(available as arXiv preprint) | 2020-05-27 | Paper |
Complexity hierarchies and higher-order cons-free rewriting
(available as arXiv preprint) | 2017-10-17 | Paper |
Complexity hierarchies and higher-order cons-free term rewriting
(available as arXiv preprint) | 2017-10-12 | Paper |
Verifying procedural programs via constrained rewriting induction
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
Verifying procedural programs via constrained rewriting induction
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
| Conditional complexity | 2017-07-12 | Paper |
The power of non-determinism in higher-order implicit complexity. Characterising complexity classes using non-deterministic cons-free programming
Programming Languages and Systems | 2017-05-19 | Paper |
Complexity of conditional term rewriting
(available as arXiv preprint) | 2017-05-08 | Paper |
Automatic constrained rewriting induction towards verifying procedural programs
Programming Languages and Systems | 2016-02-26 | Paper |
Constrained term rewriting tooL
Logic for Programming, Artificial Intelligence, and Reasoning | 2016-01-12 | Paper |
First-order formative rules
Lecture Notes in Computer Science | 2014-07-24 | Paper |
First-order formative rules
Lecture Notes in Computer Science | 2014-07-24 | Paper |
Term Rewriting with Logical Constraints
Frontiers of Combining Systems | 2013-09-20 | Paper |
Dynamic dependency pairs for algebraic functional systems
Logical Methods in Computer Science | 2012-07-03 | Paper |
| Higher order dependency pairs for algebraic functional systems | 2012-04-24 | Paper |
Harnessing first order termination provers using higher order dependency pairs
Frontiers of Combining Systems | 2011-10-07 | Paper |
Simplifying algebraic functional systems
Algebraic Informatics | 2011-07-08 | Paper |
A Higher-Order Iterative Path Ordering
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
