Compositional confluence criteria

MaRDI QIDQ6192005zbMATH OpenFDO

Authors Kiraku Shintani, Nao Hirokawa

Publication date 11 March 2024

Full work available at URL https://arxiv.org/abs/2303.03906v5

zbMATH Keywords

confluencedecreasing diagramsterm rewriting

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Compositional confluence criteria
• Confluence without termination via parallel critical pairs
• Term Rewriting and Applications
• Confluence by critical pair analysis revisited
• Confluence by critical pair analysis

Cites work

• A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
• A reduction-preserving completion for proving confluence of non-terminating term rewriting systems
• CoLL: a confluence tool for left-linear term rewrite systems
• Confluence by critical pair analysis revisited
• Confluence by Decreasing Diagrams
• Confluence of curried term-rewriting systems
• Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs
• Confluence without termination via parallel critical pairs
• Confluence: the unifying, expressive power of locality
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• CSI -- a confluence tool
• Decreasing diagrams and relative termination
• Developing developments
• From diagrammatic confluence to modularity
• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 4106267 (Why is no real title available?)
• scientific article; zbMATH DE number 512795 (Why is no real title available?)
• scientific article; zbMATH DE number 1543072 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 6744203 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Labelings for decreasing diagrams
• Layer systems for proving confluence
• Nagoya termination tool
• On the Church-Rosser property for the direct sum of term rewriting systems
• On theories with a combinatorial definition of 'equivalence'
• Proof orders for decreasing diagrams
• Properties of substitutions and unifications
• Proving Confluence of Term Rewriting Systems Automatically
• Term Rewriting and All That
• Term Rewriting and Applications
• Tree-Manipulating Systems and Church-Rosser Theorems

Cited in

(3)

• Confluence by critical pair analysis revisited
• Compositional confluence criteria
• On complexity bounds and confluence of parallel term rewriting

This page was built for publication: Compositional confluence criteria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192005)