Local confluence of conditional and generalized term rewriting systems
From MaRDI portal
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- 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.
- Applications and extensions of context-sensitive rewriting
- Automatic generation of logical models with AGES
- Automatic synthesis of logical models for order-sorted first-order theories
- Automatically Proving and Disproving Feasibility Conditions
- Completeness results for basic narrowing
- Completion of a Set of Rules Modulo a Set of Equations
- Conditional rewrite rules
- Confluence of the disjoint union of conditional term rewriting systems
- Confluence without termination via parallel critical pairs
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Decidable call-by-need computations in term rewriting
- Developing developments
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 4191131 (Why is no real title available?)
- scientific article; zbMATH DE number 4090846 (Why is no real title available?)
- scientific article; zbMATH DE number 4090848 (Why is no real title available?)
- scientific article; zbMATH DE number 4098590 (Why is no real title available?)
- scientific article; zbMATH DE number 4106267 (Why is no real title available?)
- scientific article; zbMATH DE number 1257634 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 837700 (Why is no real title available?)
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- Logic of many-sorted theories
- Modular properties of conditional term rewriting systems
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Operational termination of conditional term rewriting systems
- Programming and symbolic computation in Maude
- Protocol analysis with time and space
- Proving operational termination of membership equational programs
- Proving semantic properties as first-order satisfiability
- Semantic foundations for generalized rewrite theories
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Tree-Manipulating Systems and Church-Rosser Theorems
- Using well-founded relations for proving operational termination
Cited in
(5)- Proving confluence in the confluence framework with confident
- Preface to selected papers from 21st workshop on programming and languages (PROLE 2022)
- Confluence of conditional rewriting modulo
- Confluence of almost parallel-closed generalized term rewriting systems
- Termination of generalized term rewriting systems
This page was built for publication: Local confluence of conditional and generalized term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151615)