Applications and extensions of context-sensitive rewriting
From MaRDI portal
Publication:2043816
DOI10.1016/j.jlamp.2021.100680OpenAlexW3142758229MaRDI QIDQ2043816
Publication date: 3 August 2021
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2021.100680
Related Items (3)
Metalevel transformation of strategies ⋮ Local confluence of conditional and generalized term rewriting systems ⋮ Derivational complexity and context-sensitive Rewriting
Uses Software
Cites Work
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Lazy productivity via termination
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Normal forms and normal theories in conditional rewriting
- Relaxing monotonicity for innermost termination
- Productivity of stream definitions
- Mechanizing and improving dependency pairs
- Matrix interpretations for proving termination of term rewriting
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
- Context-sensitive dependency pairs
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Operational termination of conditional term rewriting systems
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Fundamental properties of infinite trees
- On sufficient-completeness and related properties of term rewriting systems
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- Conditional rewrite rules: Confluence and termination
- Conditional rewriting logic as a unified model of concurrency
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- A calculus of mobile processes. II
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Specification of real-time and hybrid systems in rewriting logic
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Context-sensitive rewriting strategies
- Twenty years of rewriting logic
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Synthesis of sup-interpretations: a survey
- Termination of term rewriting using dependency pairs
- Transforming derivational complexity of term rewriting to runtime complexity
- Parameterized strategies specification in Maude
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
- Proving operational termination of membership equational programs
- Programming and symbolic computation in Maude
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Semantic foundations for generalized rewrite theories
- Algebraic and logic programming. Third international conference, ALP '92, Volterra, Italy, September 2--4, 1992. Proceedings
- Algorithms with polynomial interpretation termination proof
- Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
- Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
- Induction for termination with local strategies
- Lazy Rewriting and Context-Sensitive Rewriting
- Transformation for Refining Unraveled Conditional Term Rewriting Systems
- Termination of Lazy Rewriting Revisited
- Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
- Termination of rewriting under strategies
- Unravelings and ultra-properties
- Termination of Rewriting with Strategy Annotations
- Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
- Controlled Term Rewriting
- Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
- Computationally Equivalent Elimination of Conditions
- MTT: The Maude Termination Tool (System Description)
- Automated Complexity Analysis Based on the Dependency Pair Method
- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
- Transforming Outermost into Context-Sensitive Rewriting
- From Outermost to Context-Sensitive Rewriting
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- The integration of functions into logic programming: From theory to practice
- Proving Termination in the Context-Sensitive Dependency Pair Framework
- A Dependency Pair Framework for A ∨ C-Termination
- Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
- Automatically Proving and Disproving Feasibility Conditions
- mu-term: Verify Termination Properties Automatically (System Description)
- Termination proofs and the length of derivations
- Lazy rewriting and eager machinery
- A Transformational Approach to Prove Outermost Termination Automatically
- Completion after Program Inversion of Injective Functions
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- Operational Termination of Membership Equational Programs: the Order-Sorted Way
- AC Dependency Pairs Revisited
- Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
- PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES
- On the Completeness of Context-Sensitive Order-Sorted Specifications
- Productivity of Stream Definitions
- Data-Oblivious Stream Productivity
- Improving Context-Sensitive Dependency Pairs
- Transformation techniques for context-sensitive rewrite systems
- Term Rewriting and Applications
- Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
- The Derivational Complexity Induced by the Dependency Pair Method
- Verification of Erlang processes by dependency pairs
- 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
This page was built for publication: Applications and extensions of context-sensitive rewriting
