Semantics of non-terminating rewrite systems using minimal coverings

DOI10.1007/3-540-61377-3_29MaRDI QIDQ6560159zbMATH OpenFDO

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)

Recommendations

• Algebraic semantics and complexity of term rewriting systems
• scientific article; zbMATH DE number 4124993
• scientific article; zbMATH DE number 3988695
• scientific article; zbMATH DE number 1722708
• Infinite normal forms for non-linear term rewriting systems

Cites work

• scientific article; zbMATH DE number 3649971 (Why is no real title available?)
• scientific article; zbMATH DE number 3951980 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3684925 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• Conditional rewriting logic as a unified model of concurrency
• Continuous Data Types
• Infinite trees in normal form and recursive equations having a unique solution
• Initial Algebra Semantics and Continuous Algebras
• Operational and Semantic Equivalence Between Recursive Programs
• Transfinite reductions in orthogonal term rewriting systems
• Varieties of ordered algebras

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)