Idempotent anti-unification

DOI10.1145/3359060MaRDI QIDQ4972174zbMATH OpenOpenAlexWikidataFDO

Authors David M. Cerna, Temur Kutsia

Publication date 22 November 2019

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3359060

zbMATH Keywords

anti-unificationgeneralizationidempotenceregular tree grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• On complexity of the anti-unification problem
• Nominal anti-unification
• Higher-order equational pattern anti-unification
• Anti-unification in constraint logic programming
• Higher-order pattern generalization modulo equational theories

Cited in

(9)

• Order-sorted equational generalization algorithm revisited
• Anti-unification and the theory of semirings
• Higher-order pattern generalization modulo equational theories
• Variant-based equational anti-unification
• Towards Fast Nominal Anti-unification of Letrec-Expressions
• One or nothing: anti-unification over the simply-typed lambda calculus
• Nominal anti-unification modulo equational theories
• Unital anti-unification: type and algorithms
• Equational anti-unification over absorption theories

This page was built for publication: Idempotent anti-unification

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