Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952157 | Theoretical Computer Science | 2017 | 65 Pages |
Abstract
Conditional rewriting modulo axioms with rich types makes specifications and declarative programs very expressive and succinct and is used in all well-known rule-based languages. However, the current foundations of rewriting modulo axioms have focused for the most part on the unconditional and untyped case. The main purpose of this work is to generalize the foundations of rewriting modulo axioms to the conditional order-sorted case. A related goal is to simplify such foundations. In particular, even in the unconditional case, the notion of strict coherence proposed here makes rewriting modulo axioms simpler and easier to understand. Properties of strictly coherent conditional theories, like operational equi-termination of the âR/B and âR,B relations and general conditions for the conditional Church-Rosser property modulo B are also studied.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
José Meseguer,