| Publication | Date of Publication | Type |
|---|
Termination of graph transformation systems via generalized weighted type graphs
Logical Methods in Computer Science | 2026-03-23 | Paper |
Termination of graph transformation systems using weighted subgraph counting
Logical Methods in Computer Science | 2025-01-31 | Paper |
| Correspondence between composite theories and distributive laws | 2025-01-20 | Paper |
| From linear term rewriting to graph rewriting with preservation of termination | 2024-12-06 | Paper |
| Confluence of the Chinese Monoid | 2024-03-14 | Paper |
scientific article; zbMATH DE number 7809761 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-27 | Paper |
| scientific article; zbMATH DE number 7809761 (Why is no real title available?) | 2024-02-27 | Paper |
| Termination of graph transformation systems using weighted subgraph counting | 2024-01-12 | Paper |
| Fuzzy presheaves are quasitoposes | 2024-01-12 | Paper |
Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes
Journal of Logical and Algebraic Methods in Programming | 2023-06-19 | Paper |
Algebraic presentation of semifree monads
(available as arXiv preprint) | 2022-12-07 | Paper |
Patch graph rewriting
Graph Transformation | 2022-09-01 | Paper |
Algebraic Presentation of Semifree Monads
(available as arXiv preprint) | 2022-05-11 | Paper |
Graph rewriting and relabeling with PBPO\textsuperscript{+}
(available as arXiv preprint) | 2022-03-21 | Paper |
scientific article; zbMATH DE number 7379291 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-05 | Paper |
| Decreasing diagrams with two labels are complete for confluence of countable systems | 2021-06-15 | Paper |
Transducer degrees: atoms, infima and suprema
Acta Informatica | 2020-05-26 | Paper |
scientific article; zbMATH DE number 7199582 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-12 | Paper |
| scientific article; zbMATH DE number 7199582 (Why is no real title available?) | 2020-05-12 | Paper |
| scientific article; zbMATH DE number 7084951 (Why is no real title available?) | 2019-07-24 | Paper |
Braids via term rewriting
Theoretical Computer Science | 2019-06-18 | Paper |
Syllogistic logic with ``most''
Mathematical Structures in Computer Science | 2019-05-27 | Paper |
Degrees of infinite words, polynomials and atoms
International Journal of Foundations of Computer Science | 2018-09-20 | Paper |
| Streams are forever | 2018-09-04 | Paper |
Regularity preserving but not reflecting encodings
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
On periodically iterated morphisms
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Coinductive foundations of infinitary rewriting and infinitary equational logic
(available as arXiv preprint) | 2018-01-12 | Paper |
| A coinductive framework for infinitary rewriting and equational reasoning | 2017-07-12 | Paper |
Proving non-termination by finite automata
(available as arXiv preprint) | 2017-07-12 | Paper |
Clocked lambda calculus
Mathematical Structures in Computer Science | 2017-06-14 | Paper |
Automatic sequences and zip-specifications
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
| scientific article; zbMATH DE number 6678680 (Why is no real title available?) | 2017-01-27 | Paper |
Degrees of Infinite Words, Polynomials and Atoms
Developments in Language Theory | 2016-08-30 | Paper |
Majority digraphs
Proceedings of the American Mathematical Society | 2016-06-22 | Paper |
Degrees of transducibility
Lecture Notes in Computer Science | 2015-11-04 | Paper |
The degree of squares is an atom
Lecture Notes in Computer Science | 2015-11-04 | Paper |
The degree of squares is an atom
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Syllogistic logic with ``most''
Logic, Language, Information, and Computation | 2015-09-24 | Paper |
Eigenvalues and transduction of morphic sequences
Developments in Language Theory | 2014-10-14 | Paper |
De Bruijn's weak diamond property revisited
Indagationes Mathematicae. New Series | 2014-09-03 | Paper |
On the complexity of stream equality
Journal of Functional Programming | 2014-08-14 | Paper |
On the complexity of equivalence of specifications of infinite objects
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming | 2014-07-21 | Paper |
Discriminating lambda-terms using clocked Böhm trees
Logical Methods in Computer Science | 2014-06-10 | Paper |
Infinitary term rewriting for weakly orthogonal systems: properties and counterexamples
Logical Methods in Computer Science | 2014-06-10 | Paper |
Clocks for Functional Programs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Degrees of streams
Integers | 2013-10-25 | Paper |
Circular coinduction in Coq using bisimulation-up-to techniques
Interactive Theorem Proving | 2013-08-07 | Paper |
Fast leader election in anonymous rings with bounded expected delay
Information Processing Letters | 2013-04-04 | Paper |
Mix-automatic sequences
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Highlights in infinitary rewriting and lambda calculus
Theoretical Computer Science | 2013-01-07 | Paper |
| Unique normal forms in infinitary weakly orthogonal rewriting | 2012-04-25 | Paper |
| Proving equality of streams automatically | 2012-04-24 | Paper |
| Arithmetic Self-Similarity of Infinite Sequences | 2012-01-18 | Paper |
On equal -terms
Theoretical Computer Science | 2011-07-07 | Paper |
Lazy productivity via termination
Theoretical Computer Science | 2011-07-07 | Paper |
Levels of undecidability in rewriting
Information and Computation | 2011-02-21 | Paper |
Local termination: theory and practice
Logical Methods in Computer Science | 2010-09-21 | Paper |
Transforming Outermost into Context-Sensitive Rewriting
Logical Methods in Computer Science | 2010-07-27 | Paper |
Productivity of stream definitions
Theoretical Computer Science | 2010-02-09 | Paper |
Degrees of Undecidability in Term Rewriting
Computer Science Logic | 2009-11-12 | Paper |
Complexity of Fractran and Productivity
Automated Deduction – CADE-22 | 2009-07-28 | Paper |
Proving Infinitary Normalization
Lecture Notes in Computer Science | 2009-07-02 | Paper |
Local Termination
Rewriting Techniques and Applications | 2009-06-30 | Paper |
From Outermost to Context-Sensitive Rewriting
Rewriting Techniques and Applications | 2009-06-30 | Paper |
Matrix Interpretations for Proving Termination of Term Rewriting
Automated Reasoning | 2009-03-12 | Paper |
Data-Oblivious Stream Productivity
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Reduction Under Substitution
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Matrix interpretations for proving termination of term rewriting
Journal of Automated Reasoning | 2008-06-11 | Paper |
Productivity of Stream Definitions
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Correspondence between Composite Theories and Distributive Laws
(available as arXiv preprint) | N/A | Paper |
