Anti-unification and the theory of semirings
From MaRDI portal
Publication:2215964
DOI10.1016/j.tcs.2020.10.020zbMath1464.68138OpenAlexW3094511856MaRDI QIDQ2215964
Publication date: 15 December 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.10.020
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unification under associativity and idempotence is of type nullary
- The theory of idempotent semigroups is of unification type zero
- Unification theory
- Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
- Higher order generalization and its application in program verification
- Complete sets of unifiers and matchers in equational theories
- Inductive theorem proving based on tree grammars
- Higher-order pattern anti-unification in linear time
- A modular order-sorted equational generalization algorithm
- E-generalization using grammars
- Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
- Idempotent Anti-unification
- Term-Graph Anti-Unification
- Unification, weak unification, upper bound, lower bound, and generalization problems
- A Generic Framework for Higher-Order Generalizations.
This page was built for publication: Anti-unification and the theory of semirings