pith. sign in

arxiv: 1404.7695 · v1 · pith:TFR3T7WKnew · submitted 2014-04-30 · 💻 cs.LO

First-Order Formative Rules

classification 💻 cs.LO
keywords rulesfirst-orderformativehigher-ordersettingtermallowallows
0
0 comments X
read the original abstract

This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints that need to be solved during a termination proof. Compared to the higher-order definition, the first-order setting allows for significant improvements of the technique.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.