10 citations · 14 across the 4 of their papers we have counts for
4 papers
Confluence by Critical Pair Analysis Revisited (Extended Version)
Nao Hirokawa, Julian Nagele, Vincent van Oostrom +1
We present two methods for proving confluence of left-linear term rewrite systems. One is hot-decreasingness, combining the parallel/development closedness theorems with rule label…
Nested Term Graphs (Work In Progress)
Clemens Grabmayer, Vincent van Oostrom
We report on work in progress on 'nested term graphs' for formalizing higher-order terms (e.g. finite or infinite lambda-terms), including those expressing recursion (e.g. terms in…
Layer Systems for Proving Confluence
Bertram Felgenhauer, Aart Middeldorp, Harald Zankl +1
We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers.…
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples
Joerg Endrullis, Clemens Grabmayer, Dimitri Hendriks +2
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show…