Checking overlaps of nominal rewriting rules
From MaRDI portal
Publication:1744404
Recommendations
Cites work
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- A formalization of the Knuth-Bendix(-Huet) critical pair theorem
- Automata, Languages and Programming
- Combinatory reduction systems: Introduction and survey
- Confluence of orthogonal nominal rewriting systems revisited
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Formalizing the confluence of orthogonal rewriting systems
- Higher-order rewrite systems and their confluence
- Matching and alpha-equivalence check for nominal terms
- Nominal completion for rewrite systems with binders
- Nominal rewriting
- Nominal unification
- On theories with a combinatorial definition of 'equivalence'
- Relating nominal and higher-order rewriting
- Tree-Manipulating Systems and Church-Rosser Theorems
Cited in
(10)- Rewriting with generalized nominal unification
- Nominal confluence tool
- Confluence and commutation for nominal rewriting systems with atom-variables
- Nominal unification with atom-variables
- Confluence of orthogonal term rewriting systems in the prototype verification system
- Nominal unification with atom and context variables
- Nominal syntax with atom substitutions
- Parallel closure theorem for left-linear nominal rewriting systems
- Ground confluence and strong commutation modulo alpha-equivalence in nominal rewriting
- Confluence of orthogonal nominal rewriting systems revisited
This page was built for publication: Checking overlaps of nominal rewriting rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744404)
