4 citations · 6 across the 7 of their papers we have counts for
5 papers
Higher-Order LCTRSs and Their Termination
Liye Guo, Cynthia Kop
Logically constrained term rewriting systems (LCTRSs) are a program analyzing formalism with native support for data types which are not (co)inductively defined. As a first-order f…
Complexity Analysis for Call-by-Value Higher-Order Rewriting
Cynthia Kop, Deivid Vale
In this short paper, we consider a form of higher-order rewriting with a call-by-value evaluation strategy so as to model call-by-value programs. We briefly present a cost-size sem…
Tuple Interpretations and Applications to Higher-Order Runtime Complexity
Cynthia Kop, Deivid Vale
Tuple interpretations are a class of algebraic interpretation that subsumes both polynomial and matrix interpretations as it does not impose simple termination and allows non-linea…
First-Order Formative Rules
Carsten Fuhs, Cynthia Kop
This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, for…
Polynomial Interpretations for Higher-Order Rewriting
Carsten Fuhs, Cynthia Kop
The termination method of weakly monotonic algebras, which has been defined for higher-order rewriting in the HRS formalism, offers a lot of power, but has seen little use in recen…