Equational rules for rewriting logic
type: Item
instance of: scholarly article
title: Equational rules for rewriting logic
zbMATH Open document ID: 1001.68058
DOI: 10.1016/S0304-3975(01)00366-8
author: Patrick Viry
published in: Theoretical Computer Science
publication date: 2002-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1780628
zbMATH Keywords: rewriting
zbMATH Keywords: equational programming
zbMATH Keywords: coherence
zbMATH Keywords: building-in equality
describes a project that uses: LOTOS
describes a project that uses: OBJ3
describes a project that uses: Maude
MaRDI profile type: Publication
cites work: AC-unification race: The system solving approach, implementation and benchmarks
cites work: Term Rewriting and All That
cites work: λν, a calculus of explicit substitutions which preserves strong normalisation
cites work: Conditional rewrite rules: Confluence and termination
cites work: Q3787463
cites work: Q3817653
cites work: Higher order unification via explicit substitutions
cites work: Theorem proving modulo
cites work: Q3994895
cites work: Q4537514
cites work: Functional back-ends within the lambda-sigma calculus
cites work: Communicating sequential processes
cites work: Q4268454
cites work: Completion of a Set of Rules Modulo a Set of Equations
cites work: Q4222859
cites work: Q4447224
cites work: Conditional rewriting logic as a unified model of concurrency
cites work: Q3992568
cites work: Complete Sets of Reductions for Some Equational Theories
cites work: Extension orderings
cites work: Rewriting logic and its applications. Proceedings of the 1st international workshop, Pacific Grove, CA, USA, September 3--6, 1996
cites work: Q4223003
full work available at URL: s0304-3975(01)00366-8
OpenAlex ID: W2047406870
description: scientific article; zbMATH DE number 1780628