Semantics of non-terminating rewrite systems using minimal coverings

DOI10.1007/3-540-61377-3_29zbMATH Open1540.68109MaRDI QIDQ6560159FDOQ6560159

Authors: Jose Eduardo Mautone Barros, Joseph Goguen 

Publication date: 21 June 2024

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• Varieties of ordered algebras
• Title not available (Why is that?)
• Initial Algebra Semantics and Continuous Algebras
• Conditional rewriting logic as a unified model of concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinite trees in normal form and recursive equations having a unique solution
• Transfinite reductions in orthogonal term rewriting systems
• Title not available (Why is that?)
• Continuous Data Types
• Operational and Semantic Equivalence Between Recursive Programs

This page was built for publication: Semantics of non-terminating rewrite systems using minimal coverings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560159)