Decidable call-by-need computations in term rewriting

DOI10.1016/J.IC.2004.10.003MaRDI QIDQ1763429zbMATH OpenOpenAlexFDO

Authors Aart Middeldorp, Irène Durand

Publication date 22 February 2005

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2004.10.003

zbMATH Keywords

Call-by-needStrategiesTerm rewritingTree automata

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Decidable call by need computations in term rewriting (extended abstract)
• On the modularity of deciding call-by-need
• Sequentiality in orthogonal term rewriting systems
• Call-by-need reduction for membership conditional term rewriting systems
• Processes, Terms and Cycles: Steps on the Road to Infinity

Cites work

• Advanced topics in term rewriting
• Approximating dependency graphs using tree automata techniques
• Autowrite: A tool for checking properties of term rewriting systems
• Bounded, strongly sequential and forward-branching term rewriting systems
• Classes of equational programs that compile into efficient machine code
• Comparing curried and uncurried rewriting
• Computing in systems described by equations
• Decidability for left-linear growing term rewriting systems.
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Decidable approximations of term rewriting systems
• Decidable call-by-need computations in term rewriting
• 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 599028 (Why is no real title available?)
• scientific article; zbMATH DE number 1380890 (Why is no real title available?)
• scientific article; zbMATH DE number 234035 (Why is no real title available?)
• Layered transducing term rewriting system and its recognizability preserving property
• Modular properties of conditional term rewriting systems
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
• On the modularity of deciding call-by-need
• Right-linear finite path overlapping term rewriting systems effectively preserve recognizability
• Sequentiality in orthogonal term rewriting systems
• Sequentiality, monadic second-order logic and tree automata.

Cited in

(17)

• Decidability for left-linear growing term rewriting systems.
• Decidable call-by-need computations in term rewriting
• On the modularity of deciding call-by-need
• Approximations for strategies and termination
• Call-by-need reduction for membership conditional term rewriting systems
• Controlled term rewriting
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
• Discovering needed reductions using type theory
• Stable results and relative normalization
• Autowrite: A tool for checking properties of term rewriting systems
• Symbol different term rewrite systems
• Beyond Dependency Graphs
• Decidable call by need computations in term rewriting (extended abstract)
• First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
• Local confluence of conditional and generalized term rewriting systems
• Ground approximations of term rewriting systems
• Bottom-up rewriting for words and terms

Describes a project that uses

Uses Software

• Autowrite

This page was built for publication: Decidable call-by-need computations in term rewriting

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