On modularity of completeness in order-sorted term rewriting systems

DOI10.1007/BFB0045100MaRDI QIDQ4364594zbMATH OpenFDO

Authors Yoshinobu Kawabe, Naohiro Ishii

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/BFB0045100

zbMATH Keywords

term rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Completeness and confluence of order-sorted term rewriting
• A semantic approach to order-sorted rewriting
• Semantics of order-sorted specifications

Cited in

(8)

• Modular proofs for completeness of hierarchical term rewriting systems
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
• A partial evaluation framework for order-sorted equational programs modulo axioms
• Order-Sorted Rewriting and Congruence Closure
• Modularity of completeness revisited
• On the Completeness of Context-Sensitive Order-Sorted Specifications
• Completeness and confluence of order-sorted term rewriting
• Currying of order-sorted term rewriting systems

This page was built for publication: On modularity of completeness in order-sorted term rewriting systems

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