35 citations · 80 across the 25 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.LO2023
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…
cs.LO2023
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…
cs.LO2023
Certifying Higher-Order Polynomial Interpretations
Niels van der Weide, Deivid Vale, Cynthia Kop
Higher-order rewriting is a framework in which one can write higher-order programs and study their properties. One such property is termination: the situation that for all inputs,…