Decidable call by need computations in term rewriting (extended abstract)

DOI10.1007/3-540-63104-6_2zbMath1430.68133OpenAlexW1585460393MaRDI QIDQ5234682

Aart Middeldorp, Irène Durand

Publication date: 1 October 2019

Published in: Automated Deduction—CADE-14 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63104-6_2

zbMATH Keywords

normal formtree automatontransition ruleapproximation mappingground term

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

Root-neededness and approximations of neededness ⋮ Termination criteria for tree automata completion ⋮ Strong and NV-sequentiality of constructor systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Sequentiality in orthogonal term rewriting systems
• Tree acceptors and some of their applications
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
• Decidable approximations of term rewriting systems
• Generalized finite automata theory with an application to a decision problem of second-order logic

This page was built for publication: Decidable call by need computations in term rewriting (extended abstract)