Proving confluence in the confluence framework with confident

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
Characterizing and proving operational termination of deterministic conditional term rewriting systems
Mechanizing and improving dependency pairs
Conditional rewrite rules
Conditional rewrite rules: Confluence and termination
Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
Modularity of simple termination of term rewriting systems with shared constructors
Completeness results for basic narrowing
The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
Modular properties of composable term rewriting systems
Modularity in term rewriting revisited
On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
Logic-based program synthesis and transformation. 30th international symposium, LOPSTR 2020, Bologna, Italy, September 7--9, 2020. Proceedings
Applications and extensions of context-sensitive rewriting
Proving semantic properties as first-order satisfiability
Automatic generation of logical models with AGES
Completeness of combinations of constructor systems
Nominal rewriting
CSI: new evidence -- a progress report
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
Unravelings and ultra-properties
Data types à la carte
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
Generalizing Newman’s Lemma for Left-Linear Rewrite Systems
Dependency Pairs for Rewriting with Non-free Constructors
Proving Confluence of Term Rewriting Systems Automatically
Completion of a Set of Rules Modulo a Set of Equations
Operational and Semantic Equivalence Between Recursive Programs
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
Complete Sets of Reductions for Some Equational Theories
Term Rewriting and All That
Proving Termination in the Context-Sensitive Dependency Pair Framework
Automatically Proving and Disproving Feasibility Conditions
Level-confluence of conditional rewrite systems with extra variables in right-hand sides
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
On the Church-Rosser property for the direct sum of term rewriting systems
Logic for Programming, Artificial Intelligence, and Reasoning
Ground confluence and strong commutation modulo alpha-equivalence in nominal rewriting
Local confluence of conditional and generalized term rewriting systems

This page was built for publication: Proving confluence in the confluence framework with confident