AI Chat AI Image Generator AI Video Text to Speech

Higher-Order LCTRSs and Their Termination

07/25/2023

∙

by Liye Guo, et al.

∙

∙

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 formalism, LCTRSs have accommodated only analysis of imperative programs so far. In this paper, we present a higher-order variant of the LCTRS formalism, which can be used to analyze functional programs. Then we study the termination problem and define a higher-order recursive path ordering (HORPO) for this new formalism.

Liye Guo
2 publications
Cynthia Kop
14 publications

page 1

page 2

page 3

page 4

research

∙ 02/23/2023

Certifying Higher-Order Polynomial Interpretations

Higher-order rewriting is a framework in which one can write higher-orde...

0 Niels van der Weide, et al. ∙

research

∙ 04/06/2019

System FR as Foundations for Stainless

We present the design, implementation, and foundation of a verifier for ...

0 Jad Hamza, et al. ∙

research

∙ 08/02/2023

Percolation in higher order networks via mapping to chygraphs

Percolation theory investigates systems of interconnected units, their r...

0 Alexei Vazquez, et al. ∙

research

∙ 11/06/2018

On the Termination Problem for Probabilistic Higher-Order Recursive Programs

In the last two decades, there has been much progress on model checking ...

0 Naoki Kobayashi, et al. ∙

research

∙ 02/22/2019

Automating the Diagram Method to Prove Correctness of Program Transformations

We report on the automation of a technique to prove the correctness of p...

0 David Sabel, et al. ∙

research

∙ 02/05/2023

The Marriage of Effects and Rewrites

In the research on computational effects, defined algebraically, effect ...

0 Ezra e. k. Cooper, et al. ∙

research

∙ 11/22/2018

Automated Amortised Resource Analysis for Term Rewrite Systems

In this paper we establish an automated amortised resource analysis for ...

0 Georg Moser, et al. ∙