Context-sensitive rewriting strategies
From MaRDI portal
Publication:1854569
DOI10.1016/S0890-5401(02)93176-7zbMath1012.68095OpenAlexW2088747311MaRDI QIDQ1854569
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0890-5401(02)93176-7
Related Items (33)
Unnamed Item ⋮ mu-term: Verify Termination Properties Automatically (System Description) ⋮ Controlled Term Rewriting ⋮ Modular and incremental proofs of AC-termination ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ Metalevel transformation of strategies ⋮ Two Decades of Maude ⋮ Modularity in term rewriting revisited ⋮ Twenty years of rewriting logic ⋮ Usable Rules for Context-Sensitive Rewrite Systems ⋮ MTT: The Maude Termination Tool (System Description) ⋮ Completeness of context-sensitive rewriting ⋮ Unnamed Item ⋮ Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications ⋮ Automating the dependency pair method ⋮ Lazy productivity via termination ⋮ Operational Termination of Membership Equational Programs: the Order-Sorted Way ⋮ Proving operational termination of membership equational programs ⋮ Context-sensitive dependency pairs ⋮ Proving semantic properties as first-order satisfiability ⋮ Applications and extensions of context-sensitive rewriting ⋮ Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting ⋮ Methods for Proving Termination of Rewriting-based Programming Languages by Transformation ⋮ Using well-founded relations for proving operational termination ⋮ Modular termination of prefix-constrained term rewrite systems ⋮ Strong and NV-sequentiality of constructor systems ⋮ Derivational complexity and context-sensitive Rewriting ⋮ Induction for termination with local strategies ⋮ Lazy Rewriting and Context-Sensitive Rewriting ⋮ On-demand strategy annotations revisited: an improved on-demand evaluation strategy ⋮ Improving the Context-sensitive Dependency Graph ⋮ Proving Termination of Context-Sensitive Rewriting with MU-TERM
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strongly sequential and inductively sequential term rewriting systems
- Root-neededness and approximations of neededness
- A sequential reduction strategy
- Programming in equational logic: Beyond strong sequentiality
- Termination of rewriting
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Sequentiality in orthogonal term rewriting systems
- LEAN: An intermediate language based on graph rewriting
- Sequential evaluation strategies for parallel-or and related reduction systems
- Sequentiality, monadic second-order logic and tree automata.
- Relative undecidability in term rewriting. I: The termination hierarchy
- Transfinite reductions in orthogonal term rewriting systems
- Termination of term rewriting using dependency pairs
- Just-in-time
- Compact Normalisation Trace via Lazy Rewriting
- Lazy Rewriting and Context-Sensitive Rewriting
- Termination of Rewriting with Strategy Annotations
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Operational and Semantic Equivalence Between Recursive Programs
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Termination of context-sensitive rewriting
- Term Rewriting and All That
- Transformation techniques for context-sensitive rewrite systems
This page was built for publication: Context-sensitive rewriting strategies
