Improving space, time, and termination in rewriting-based programming
From MaRDI portal
Recommendations
- Efficient pattern matching for non-strongly sequential term rewriting systems
- PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES
- More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
- Minimal adaptive pattern-matching automata for efficient term rewriting
- Comparison of priority rules in pattern matching and term rewriting
Cited in
(7)- More efficient left-to-right matching for overlapping pattern
- Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories
- Using term-graph rewriting models to analyse relative space efficiency
- PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES
- The specificity rule for lazy pattern-matching in ambiguous term rewrite systems
- Efficient pattern matching for non-strongly sequential term rewriting systems
- Comparison of priority rules in pattern matching and term rewriting
This page was built for publication: Improving space, time, and termination in rewriting-based programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2772660)