Conditional rewriting logic: Deduction, models and concurrency

DOI10.1007/3-540-54317-1_81OpenAlexW1525248835MaRDI QIDQ5881267

No author found.

Publication date: 9 March 2023

Published in: Conditional and Typed Rewriting Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-54317-1_81

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Compiling concurrent rewriting onto the Rewrite Rule Machine ⋮ Rewriting logic: Roadmap and bibliography ⋮ José Meseguer: Scientist and Friend Extraordinaire ⋮ Twenty years of rewriting logic ⋮ Deriving Bisimulation Congruences: A 2-categorical Approach

Uses Software

• UNITY

Cites Work

• A rationale for conditional equational programming
• Petri nets are monoids
• Varieties of chain-complete algebras
• Algebraic semantics
• Varieties of ordered algebras
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Nondeterministic algebraic specifications and nonconfluent term rewriting
• A mathematical approach to nondeterminism in data types
• An abstract formulation for rewrite systems
• From petri nets to linear logic
• Subequalizers
• Aspects of topoi
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Conditional rewriting logic: Deduction, models and concurrency