Termination of Lazy Rewriting Revisited
From MaRDI portal
Publication:2873676
DOI10.1016/j.entcs.2008.03.052zbMath1279.68120OpenAlexW2171438322WikidataQ56766882 ScholiaQ56766882MaRDI QIDQ2873676
Felix Schernhammer, Bernhard Gramlich
Publication date: 24 January 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.052
Related Items
Modularity in term rewriting revisited ⋮ Lazy productivity via termination ⋮ Context-sensitive dependency pairs ⋮ Applications and extensions of context-sensitive rewriting ⋮ Termination of Lazy Rewriting Revisited
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proving termination of context-sensitive rewriting by transformation
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Compact Normalisation Trace via Lazy Rewriting
- Lazy Rewriting and Context-Sensitive Rewriting
- Termination of Lazy Rewriting Revisited
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
- Classes of equational programs that compile into efficient machine code
- Frontiers of Combining Systems