research
∙
07/25/2023
Complexity Analysis for Call-by-Value Higher-Order Rewriting
In this short paper, we consider a form of higher-order rewriting with a...
share
research
∙
03/23/2023
Analyzing Innermost Runtime Complexity Through Tuple Interpretations
Time complexity in rewriting is naturally understood as the number of st...
research
∙
02/23/2023
Certifying Higher-Order Polynomial Interpretations
Higher-order rewriting is a framework in which one can write higher-orde...
research
∙
06/30/2022
Tuple Interpretations and Applications to Higher-Order Runtime Complexity
Tuple interpretations are a class of algebraic interpretation that subsu...
research
∙
12/10/2021
Formalizing Higher-Order Termination in Coq
We describe a formalization of higher-order rewriting theory and formall...
research
∙
05/03/2021
