Lazy rewriting and eager machinery
From MaRDI portal
Publication:5055828
Recommendations
Cites work
- scientific article; zbMATH DE number 4092749 (Why is no real title available?)
- scientific article; zbMATH DE number 3679159 (Why is no real title available?)
- scientific article; zbMATH DE number 108369 (Why is no real title available?)
- scientific article; zbMATH DE number 512903 (Why is no real title available?)
- scientific article; zbMATH DE number 675533 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 234035 (Why is no real title available?)
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Computing in systems described by equations
- Thunks
Cited in
(10)- Lazy context cloning for non-deterministic graph rewriting
- Lazy rewriting and context-sensitive rewriting
- scientific article; zbMATH DE number 5136280 (Why is no real title available?)
- Lazy narrowing: strong completeness and eager variable elimination
- Termination of lazy rewriting revisited
- scientific article; zbMATH DE number 177788 (Why is no real title available?)
- Infinitary rewriting: meta-theory and convergence
- Lazy variable-renumbering makes substitution cheap
- Applications and extensions of context-sensitive rewriting
- From Stack Traces to Lazy Rewriting Sequences
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)