On modularity in term rewriting and narrowing

DOI10.1007/BFb0016858zbMath1495.68117OpenAlexW1542860133MaRDI QIDQ5096311

Christian Prehofer

Publication date: 16 August 2022

Published in: Constraints in Computational Logics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Related Items (2)

Modular Termination of Basic Narrowing ⋮ Termination of narrowing revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular properties of conditional term rewriting systems
• Narrowing vs. SLD-resolution
• Basic narrowing revisited
• Completeness of combinations of constructor systems
• A needed narrowing strategy
• Operational and Semantic Equivalence Between Recursive Programs
• The integration of functions into logic programming: From theory to practice
• Modular aspects of properties of term rewriting systems related to normal forms
• On the Church-Rosser property for the direct sum of term rewriting systems

This page was built for publication: On modularity in term rewriting and narrowing