Lazy rewriting and eager machinery

DOI10.1007/3-540-59200-8_54zbMATH Open1503.68121OpenAlexW1553079342MaRDI QIDQ5055828FDOQ5055828

Authors: J. F. Th. Kamperman, H. R. J. Walters 

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59200-8_54

Recommendations

• Termination of lazy rewriting revisited
• Lazy rewriting and context-sensitive rewriting
• scientific article; zbMATH DE number 549962
• Comparison of priority rules in pattern matching and term rewriting
• Lazy context cloning for non-deterministic graph rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing in systems described by equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Thunks
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Title not available (Why is that?)
• Lazy variable-renumbering makes substitution cheap
• Title not available (Why is that?)
• Infinitary rewriting: meta-theory and convergence
• Applications and extensions of context-sensitive rewriting
• From Stack Traces to Lazy Rewriting Sequences
• Lazy rewriting and context-sensitive rewriting
• Termination of lazy rewriting revisited
• Lazy context cloning for non-deterministic graph rewriting
• Lazy narrowing: strong completeness and eager variable elimination

Uses Software

• OBJ3

This page was built for publication: Lazy rewriting and eager machinery

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