A sequential reduction strategy
From MaRDI portal
Publication:671504
DOI10.1016/0304-3975(96)00041-2zbMATH Open0872.68080OpenAlexW2140840438MaRDI QIDQ671504FDOQ671504
Authors: Sergio Antoy, Aart Middeldorp 
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
Recommendations
Cites Work
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional rewrite rules: Confluence and termination
- Title not available (Why is that?)
- Computing in systems described by equations
- Sequential evaluation strategies for parallel-or and related reduction systems
- Title not available (Why is that?)
- Programming in equational logic: Beyond strong sequentiality
Cited In (16)
- Title not available (Why is that?)
- On abstract normalisation beyond neededness
- Optimal normalization in orthogonal term rewriting systems
- Reducing sequences
- Leftmost outermost revisited
- A confluent rewriting system having no computable, one-step, normalizing strategy
- Sequential evaluation strategies for parallel-or and related reduction systems
- An Addition Strategy for Reduct Construction
- Title not available (Why is that?)
- Rewriting strategies and strategic rewrite programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Context-sensitive rewriting strategies
- Reduction Strategies and Acyclicity
- Default rules for Curry
- Title not available (Why is that?)
This page was built for publication: A sequential reduction strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671504)
