Local confluence of conditional and generalized term rewriting systems
From MaRDI portal
Publication:6151615
DOI10.1016/j.jlamp.2023.100926MaRDI QIDQ6151615
Publication date: 12 February 2024
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modular properties of conditional term rewriting systems
- A rationale for conditional equational programming
- 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
- Conditional rewrite rules
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- Completeness results for basic narrowing
- Developing developments
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Automatic synthesis of logical models for order-sorted first-order theories
- Decidable call-by-need computations in term rewriting
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Applications and extensions of context-sensitive rewriting
- Protocol analysis with time and space
- Proving operational termination of membership equational programs
- Proving semantic properties as first-order satisfiability
- Programming and symbolic computation in Maude
- Using well-founded relations for proving operational termination
- Automatic generation of logical models with AGES
- Semantic foundations for generalized rewrite theories
- Completion of a Set of Rules Modulo a Set of Equations
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Automatically Proving and Disproving Feasibility Conditions
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- A Machine-Oriented Logic Based on the Resolution Principle
- Tree-Manipulating Systems and Church-Rosser Theorems
- Logic of many-sorted theories
- Confluence without termination via parallel critical pairs
- Confluence of the disjoint union of conditional term rewriting systems
This page was built for publication: Local confluence of conditional and generalized term rewriting systems
