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

DOI10.1007/3-540-63104-6_2MaRDI QIDQ5234682zbMATH OpenOpenAlexFDO

Authors Irène Durand, Aart Middeldorp

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

approximation mappingground termnormal formtransition ruletree automaton

Mathematics Subject Classification ID

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

Recommendations

• Decidable call-by-need computations in term rewriting
• scientific article; zbMATH DE number 1701352
• Decidability for left-linear growing term rewriting systems.
• scientific article; zbMATH DE number 1405630
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems

Cites work

• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Decidable approximations of term rewriting systems
• Generalized finite automata theory with an application to a decision problem of second-order logic
• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 3928342 (Why is no real title available?)
• scientific article; zbMATH DE number 19765 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1380887 (Why is no real title available?)
• scientific article; zbMATH DE number 1380890 (Why is no real title available?)
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
• Sequentiality in orthogonal term rewriting systems
• Tree acceptors and some of their applications

Cited in

(10)

• Strong and NV-sequentiality of constructor systems
• Decidability for left-linear growing term rewriting systems.
• Decidable call-by-need computations in term rewriting
• Call-by-need reduction for membership conditional term rewriting systems
• Root-neededness and approximations of neededness
• scientific article; zbMATH DE number 3988695 (Why is no real title available?)
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
• scientific article; zbMATH DE number 1405630 (Why is no real title available?)
• Decidable approximations of term rewriting systems
• Termination criteria for tree automata completion

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

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