A weakly monotonic, logically constrained, HORPO-variant

Abstract

In this short paper, we present a simple variant of the recursive path ordering, specified for Logically Constrained Simply Typed Rewriting Systems (LCSTRSs). This is a method for curried systems, without lambda but with partially applied function symbols, which can deal with logical constraints. As it is designed for use in the dependency pair framework, it is defined as reduction pair, allowing weak monotonicity.

arXiv commentTechnical report detailing an adaptation of the method in https://link.springer.com/chapter/10.1007/978-3-031-57267-8_13