10 citations · 11 across the 3 of their papers we have counts for
3 papers
cs.LO2020
Tools in Term Rewriting for Education
Sarah Winkler, Aart Middeldorp
Term rewriting is a Turing complete model of computation. When taught to students of computer science, key properties of computation as well as techniques to analyze programs on an…
cs.LO2014★ 1 cited
Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited
Friedrich Neurauter, Aart Middeldorp
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and…
cs.LO2014★ 10 cited
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.…