35 citations · 80 across the 25 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.CC2016★ 6 cited
Complexity Hierarchies and Higher-order Cons-free Term Rewriting
Cynthia Kop, Jakob Grue Simonsen
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of the left-hand sides; the computational intuit…
cs.CC2016
Complexity Hierarchies and Higher-Order Cons-Free Rewriting
Cynthia Kop, Jakob Grue Simonsen
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of constructor terms in the left-hand side; the…
cs.LO2016★ 6 cited
Termination of LCTRSs
Cynthia Kop
Logically Constrained Term Rewriting Systems (LCTRSs) provide a general framework for term rewriting with constraints. We discuss a simple dependency pair approach to prove termina…