Context-sensitive rewriting strategies
From MaRDI portal
Publication:1854569
DOI10.1016/S0890-5401(02)93176-7zbMATH Open1012.68095OpenAlexW2088747311MaRDI QIDQ1854569FDOQ1854569
Authors: Salvador Lucas 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Term Rewriting and All That
- Termination of rewriting
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Sequentiality in orthogonal term rewriting systems
- LEAN: An intermediate language based on graph rewriting
- Strongly sequential and inductively sequential term rewriting systems
- Root-neededness and approximations of neededness
- 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?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Title not available (Why is that?)
- Termination of context-sensitive rewriting
- Title not available (Why is that?)
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Transfinite reductions in orthogonal term rewriting systems
- Title not available (Why is that?)
- Lazy rewriting and context-sensitive rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sequentiality, monadic second-order logic and tree automata.
- Relative undecidability in term rewriting. I: The termination hierarchy
- Title not available (Why is that?)
- Sequential evaluation strategies for parallel-or and related reduction systems
- A sequential reduction strategy
- Programming in equational logic: Beyond strong sequentiality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Termination of rewriting with strategy annotations
- Title not available (Why is that?)
- Transformation techniques for context-sensitive rewrite systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compact normalisation trace via lazy rewriting
- Just-in-time: on strategy annotations
- Operational and Semantic Equivalence Between Recursive Programs
- Title not available (Why is that?)
Cited In (42)
- Operational termination of membership equational programs: the order-sorted way
- Modularity in term rewriting revisited
- Twenty years of rewriting logic
- mu-term: Verify Termination Properties Automatically (System Description)
- Proving operational termination of membership equational programs
- Fundamentals of context-sensitive rewriting
- Title not available (Why is that?)
- Proving termination of context-sensitive rewriting with MU-TERM
- Automating the dependency pair method
- Using well-founded relations for proving operational termination
- Lazy productivity via termination
- Strategic rewriting
- Context rewriting
- Complexity of conditional term rewriting
- Polynomials over the reals in proofs of termination : from theory to practice
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Proving termination of context-sensitive rewriting by transformation
- Title not available (Why is that?)
- MTT: The Maude Termination Tool (System Description)
- Modular termination of prefix-constrained term rewrite systems
- Title not available (Why is that?)
- Applications and extensions of context-sensitive rewriting
- An Overview of the Maude Strategy Language and its Applications
- Scattered versus context-sensitive rewriting
- Controlled term rewriting
- Methods for proving termination of rewriting-based programming languages by transformation
- Strong and NV-sequentiality of constructor systems
- Completeness of context-sensitive rewriting
- Metalevel transformation of strategies
- Improving the context-sensitive dependency graph
- Induction for termination with local strategies
- Lazy rewriting and context-sensitive rewriting
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
- Proving semantic properties as first-order satisfiability
- Using context-sensitive rewriting for proving innermost termination of rewriting
- Correct and complete (positive) strategy annotations for \textsf{OBJ}
- Usable Rules for Context-Sensitive Rewrite Systems
- Modular and incremental proofs of AC-termination
- Context-sensitive dependency pairs
- Transforming Outermost into Context-Sensitive Rewriting
- Derivational complexity and context-sensitive Rewriting
- Two Decades of Maude
Uses Software
This page was built for publication: Context-sensitive rewriting strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854569)
