Root-neededness and approximations of neededness

DOI10.1016/S0020-0190(98)00118-5zbMath1339.68139OpenAlexW1971837177MaRDI QIDQ293367

Salvador Lucas

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001185?np=y

zbMATH Keywords

term rewritingneedednessroot-needednesssequentialitystrategies

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Strong and NV-sequentiality of constructor systems ⋮ Context-sensitive rewriting strategies

Cites Work

• Unnamed Item
• Sequentiality in orthogonal term rewriting systems
• LEAN: An intermediate language based on graph rewriting
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
• Decidable approximations of term rewriting systems
• Decidable call by need computations in term rewriting (extended abstract)

This page was built for publication: Root-neededness and approximations of neededness