Nominal completion for rewrite systems with binders

DOI10.1007/978-3-642-31585-5_21MaRDI QIDQ3167012zbMATH OpenOpenAlexFDO

Authors Maribel Fernández, Albert Rubio

Publication date 1 November 2012

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31585-5_21

zbMATH Keywords

rewritingnominal syntaxcompletionorderings

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Nominal rewriting
• Confluence of orthogonal nominal rewriting systems revisited
• Completion for logically constrained rewriting
• Rewriting with generalized nominal unification
• Completeness in PVS of a nominal unification algorithm

Cited in

(7)

• Rewriting with generalized nominal unification
• Nominal confluence tool
• Completeness in PVS of a nominal unification algorithm
• Hierarchical nominal terms and their theory of rewriting
• Checking overlaps of nominal rewriting rules
• Nominal unification with atom and context variables
• Nominal rewriting

This page was built for publication: Nominal completion for rewrite systems with binders

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