On composable properties of term rewriting systems

DOI10.1007/BFB0027006MaRDI QIDQ4364373zbMATH OpenFDO

Authors Takahito Aoto, Yoshihito Toyama

Publication date 17 November 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0027006

zbMATH Keywords

term rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Modular properties of composable term rewriting systems
• Termination for direct sums of left-linear complete term rewriting systems
• Completeness of combinations of constructor systems
• Modular properties of conditional term rewriting systems

Cited in

(7)

• On sufficient-completeness and related properties of term rewriting systems
• Congruential complements of ground term rewrite systems
• On the descriptive power of term rewriting systems
• scientific article; zbMATH DE number 3890721 (Why is no real title available?)
• Proving Confluence of Term Rewriting Systems Automatically
• A Compositional Semantics of Reaction Systems with Restriction
• A fast decision procedure for uniqueness of normal forms w.r.t. conversion of shallow term rewriting systems

This page was built for publication: On composable properties of term rewriting systems

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