Anti-unification and the theory of semirings
From MaRDI portal
(Redirected from Publication:2215964)
Recommendations
Cites work
- scientific article; zbMATH DE number 1358710 (Why is no real title available?)
- scientific article; zbMATH DE number 3349328 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- A Generic Framework for Higher-Order Generalizations.
- A modular order-sorted equational generalization algorithm
- Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
- Complete sets of unifiers and matchers in equational theories
- E-generalization using grammars
- Higher order generalization and its application in program verification
- Higher-order pattern anti-unification in linear time
- Idempotent anti-unification
- Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
- Inductive theorem proving based on tree grammars
- Term-graph anti-unification
- The theory of idempotent semigroups is of unification type zero
- Unification in monoidal theories
- Unification theory
- Unification theory
- Unification under associativity and idempotence is of type nullary
- Unification, weak unification, upper bound, lower bound, and generalization problems
This page was built for publication: Anti-unification and the theory of semirings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215964)