Completeness of context-sensitive rewriting
From MaRDI portal
Recommendations
Cites work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Context-sensitive rewriting strategies
- scientific article; zbMATH DE number 1332639 (Why is no real title available?)
- On the Completeness of Context-Sensitive Order-Sorted Specifications
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
Cited in
(11)- Applications and extensions of context-sensitive rewriting
- Completeness of string analysis for dynamic languages
- Derivational complexity and context-sensitive Rewriting
- Complete involutive rewriting systems
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Completeness of rewrite rules and rewrite strategies for FP
- On context-free rewriting with a simple restriction and its computational completeness
- scientific article; zbMATH DE number 1332639 (Why is no real title available?)
- scientific article; zbMATH DE number 2090080 (Why is no real title available?)
- Syntactic Completeness of Proper Display Calculi
- Completion of rewrite systems with membership constraints
This page was built for publication: Completeness of context-sensitive rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477588)