Term-rewriting systems with rule priorities

DOI10.1016/0304-3975(89)90006-6zbMath0686.68018OpenAlexW2105803012MaRDI QIDQ1262749

Jan Willem Klop, W. P. Weijland, Jos C. M. Baeten, Jan A. Bergstra

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1657

zbMATH Keywords

semanticscomplete rewrite systempriority rewrite system

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Thue and Post systems, etc. (03D03)

Related Items

Semantics and strong sequentially of priority term rewriting systems ⋮ A rewriting logic framework for operational semantics of membrane systems ⋮ Rewriting systems over similarity and generalized pseudometric spaces and their properties ⋮ Conditional Bigraphs ⋮ First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation ⋮ Term rewriting systems with sort priorities ⋮ Lambda calculus with patterns ⋮ A survey of strategies in rule-based program transformation systems ⋮ Rooted branching bisimulation as a congruence ⋮ Termination of Priority Rewriting ⋮ Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing ⋮ Semantics and expressiveness of ordered SOS ⋮ Generating priority rewrite systems for OSOS process languages ⋮ SPASS-AR: a first-order theorem prover based on approximation-refinement into the monadic shallow linear fragment ⋮ Semantics and strong sequentiality of priority term rewriting systems ⋮ Operational semantics of rewriting with priorities ⋮ A tale of two graph models: a case study in wireless sensor networks ⋮ Conditions for confluence of innermost terminating term rewriting systems ⋮ Ordered SOS process languages for branching and eager bisimulations

Cites Work

• Conditional rewrite rules
• Algebraic specifications of computable and semicomputable data types
• Conditional rewrite rules: Confluence and termination
• Computing in systems described by equations
• A lattice-theoretical fixpoint theorem and its applications
• Initial Algebra Semantics and Continuous Algebras
• Can programming be liberated from the von Neumann style?
• On the Church-Rosser property for the direct sum of term rewriting systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item