A sequential reduction strategy

DOI10.1016/0304-3975(96)00041-2zbMath0872.68080OpenAlexW2140840438MaRDI QIDQ671504

Aart Middeldorp, Sergio Antoy

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00041-2

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

Rewriting Strategies and Strategic Rewrite Programs ⋮ A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy ⋮ Default rules for Curry ⋮ On abstract normalisation beyond neededness ⋮ Context-sensitive rewriting strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programming in equational logic: Beyond strong sequentiality
• Conditional rewrite rules: Confluence and termination
• Computing in systems described by equations
• Sequential evaluation strategies for parallel-or and related reduction systems
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems

This page was built for publication: A sequential reduction strategy