| Publication | Date of Publication | Type |
|---|
| UNICOM: A refined completion based inductive theorem prover | 2023-04-28 | Paper |
Sufficient conditions for modular termination of conditional term rewriting systems
Conditional Term Rewriting Systems | 2023-03-09 | Paper |
A constructor-based approach for positive/negative-conditional equational specifications
Conditional Term Rewriting Systems | 2023-03-09 | Paper |
Confluence without termination via parallel critical pairs
Trees in Algebra and Programming — CAAP '96 | 2023-02-23 | Paper |
Confluence of terminating conditional rewrite systems revisited
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Simple termination is difficult
Rewriting Techniques and Applications | 2022-12-09 | Paper |
On proving termination by innermost termination
Rewriting Techniques and Applications | 2022-12-09 | Paper |
| On soundness conditions for unraveling deterministic conditional rewrite systems | 2020-05-27 | Paper |
On notions of inductive validity for first-order equational clauses
Automated Deduction — CADE-12 | 2020-01-21 | Paper |
Termination of lazy rewriting revisited
Electronic Notes in Theoretical Computer Science | 2014-01-24 | Paper |
A framework for timed concurrent constraint programming with external functions
Electronic Notes in Theoretical Computer Science | 2013-12-20 | Paper |
| Strategic issues, problems and challenges in inductive theorem proving | 2013-09-25 | Paper |
Modularity in term rewriting revisited
Theoretical Computer Science | 2013-01-07 | Paper |
Realizing monads in interaction nets via generic typed rules
Lecture Notes in Computer Science | 2012-07-16 | Paper |
| On (un)soundness of unravelings | 2012-04-25 | Paper |
Characterizing and proving operational termination of deterministic conditional term rewriting systems
The Journal of Logic and Algebraic Programming | 2010-10-22 | Paper |
On-demand strategy annotations revisited: an improved on-demand evaluation strategy
Theoretical Computer Science | 2009-12-15 | Paper |
Transformations of Conditional Rewrite Systems Revisited
Recent Trends in Algebraic Development Techniques | 2009-10-22 | Paper |
Generalizing Newman’s Lemma for Left-Linear Rewrite Systems
Lecture Notes in Computer Science | 2008-09-25 | Paper |
| scientific article; zbMATH DE number 2090303 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 1980914 (Why is no real title available?) | 2003-09-15 | Paper |
| scientific article; zbMATH DE number 1761895 (Why is no real title available?) | 2002-07-01 | Paper |
On interreduction of semi-complete term rewriting systems
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1324443 (Why is no real title available?) | 1999-08-16 | Paper |
| scientific article; zbMATH DE number 1300971 (Why is no real title available?) | 1999-07-29 | Paper |
On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 794237 (Why is no real title available?) | 1996-06-10 | Paper |
A constructor-based approach to positive/negative-conditional equational specifications
Journal of Symbolic Computation | 1995-09-19 | Paper |
Simple termination is difficult
Applicable Algebra in Engineering, Communication and Computing | 1995-01-31 | Paper |
Generalized sufficient conditions for modular termination of rewriting
Applicable Algebra in Engineering, Communication and Computing | 1994-07-04 | Paper |
| scientific article; zbMATH DE number 559223 (Why is no real title available?) | 1994-05-24 | Paper |
