  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.
