2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.LO2024★ 2 cited
Higher-Order Constrained Dependency Pairs for (Universal) Computability
Liye Guo, Kasper Hagens, Cynthia Kop +1
Dependency pairs constitute a series of very effective techniques for the termination analysis of term rewriting systems. In this paper, we adapt the static dependency pair framewo…
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
Analyzing Innermost Runtime Complexity Through Tuple Interpretations
Liye Guo, Deivid Vale
Time complexity in rewriting is naturally understood as the number of steps needed to reduce terms to normal forms. Establishing complexity bounds to this measure is a well-known p…