Decidable call-by-need computations in term rewriting

DOI10.1016/j.ic.2004.10.003zbMath1101.68628OpenAlexW2106516665MaRDI QIDQ1763429

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

Term rewritingTree automataCall-by-needStrategies

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Controlled Term Rewriting, First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification, Decidability for left-linear growing term rewriting systems., Local confluence of conditional and generalized term rewriting systems, Symbol different term rewrite systems, Decidable call-by-need computations in term rewriting, Beyond Dependency Graphs, Bottom-up rewriting for words and terms

Uses Software

• Autowrite

Cites Work

• Modular properties of conditional term rewriting systems
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Computing in systems described by equations
• Sequentiality in orthogonal term rewriting systems
• Decidability for left-linear growing term rewriting systems.
• Decidable call-by-need computations in term rewriting
• Sequentiality, monadic second-order logic and tree automata.
• Bounded, strongly sequential and forward-branching term rewriting systems
• Comparing curried and uncurried rewriting
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
• Classes of equational programs that compile into efficient machine code
• Decidable approximations of term rewriting systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item