Equational rules for rewriting logic Export

@article{citeulike:1221604, abstract = {In addition to equations and rules, we introduce equational rules that are oriented while having an equational interpretation. Correspondence between operational behavior and intended semantics is guaranteed by a property of coherence, which can be checked by examination of critical pairs and linearity conditions. We present applications of this theory to three examples where the rewrite relation is interpreted, respectively, as equality, transition and deduction.}, author = {Viry, Patrick}, citeulike-article-id = {1221604}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/S0304-3975(01)00366-8}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6V1G-44HXF49-2/2/72698264478101b81068cc1381e0e4a4}, doi = {10.1016/S0304-3975(01)00366-8}, journal = {Theoretical Computer Science}, keywords = {coherence, rewriting\_logic}, month = {August}, number = {2}, pages = {487--517}, posted-at = {2007-04-12 08:04:37}, priority = {4}, title = {Equational rules for rewriting logic}, url = {http://dx.doi.org/10.1016/S0304-3975(01)00366-8}, volume = {285}, year = {2002} }

TY - JOUR ID - citeulike:1221604 L3 - citeulike-article-id:1221604 N2 - In addition to equations and rules, we introduce equational rules that are oriented while having an equational interpretation. Correspondence between operational behavior and intended semantics is guaranteed by a property of coherence, which can be checked by examination of critical pairs and linearity conditions. We present applications of this theory to three examples where the rewrite relation is interpreted, respectively, as equality, transition and deduction. IS - 2 JF - Theoretical Computer Science EP - 517 TI - Equational rules for rewriting logic VL - 285 SP - 487 KW - coherence KW - rewriting_logic AU - Viry, Patrick PY - 2002/08/28/ UR - http://dx.doi.org/10.1016/S0304-3975(01)00366-8 ER -