Constrained Higher-Order Rewriting and Program Equivalence (CHORPE)

From February 2021 to January 2026 I will lead the NWO VIDI project Constrained Higher-Order Rewriting and Program Equivalence, grant number VI.Vidi.193.075. This page list the work performed as part of this project.


Project goals

The goal of CHORPE is to study program equivalence through translations to logically constrained term rewriting systems. Our particular focus is to translate higher-order features and use the knowledge of higher-order term rewriting analysis from the rewriting community.

Collaborations

We have started the TEA seminar, an online seminar uniting groups in Nijmegen, Amsterdam and Nagoya who all work on equivalence of and through term rewriting.

Publications

To date, the project has resulted in two publications in formal conference proceedings, and four informal papers documenting work in progress. Use the green download buttons to obtain the author copies.

Publications in formal conference proceedings

download 'Cutting a Proof into Bite-Sized Chunks', proceedings for FSCD 2022
Cutting a Proof into Bite-Sized Chunks: Incrementally proving termination in higher-order term rewriting, by Cynthia Kop, proceedings for FSCD 2022
download 'Analyzing Innermost Runtime Complexity Through Tuple Interpretations', proceedings for LSFA 2022
Analyzing Innermost Runtime Complexity Through Tuple Interpretations, by Liye Guo and Deivid Vale, proceedings for LSFA 2022

Publications in informal workshop proceedings

download 'Higher-Order LCTRSs and Their Termination', proceedings for HOR 2023
Higher-order LCTRSs and their termination, by Liye Guo and Cynthia Kop, proceedings for HOR 2023
download 'Matrix invariants for program equivalence in LCTRSs', proceedings for WPTE 2023
Matrix invariants for program equivalence in LCTRSs, by Kasper Hagens and Cynthia Kop, proceedings for WPTE 2023
download 'A transitive HORPO for curried systems', proceedings for WST 2022
A transitive HORPO for curried systems by Liye Guo and Cynthia Kop, proceedings for WST 2022
download 'Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems', workshop proceedings for WPTE 2022
Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems by Wouter Brozius, Kasper Hagens and Cynthia Kop, proceedings for WPTE 2022

Submitted to journals

Project members

Cynthia Kop Liye Guo Kasper Hagens Deivid Vale