2 citations · 2 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LO2021
Formalizing Higher-Order Termination in Coq
Deivid Vale, Niels van der Weide
We describe a formalization of higher-order rewriting theory and formally prove that an AFS is strongly normalizing if it can be interpreted in a well-founded domain. To do so, we…
cs.SC2021
Tuple Interpretations for Higher-Order Rewriting
Deivid Vale, Cynthia Kop
We develop a class of algebraic interpretations for many-sorted and higher-order term rewriting systems that takes type information into account. Specifically, base-type terms are…