Semi-unification of two terms in Abelian groups
From MaRDI portal
Publication:1336738
DOI10.1016/0020-0190(94)00127-8zbMath0821.68070MaRDI QIDQ1336738
Publication date: 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00127-8
68W30: Symbolic computation and algebraic computation
68N15: Theory of programming languages
20K99: Abelian groups
Related Items
Cites Work
- Unification theory
- The undecidability of the semi-unification problem
- Programming languages and systems - ESOP '94. 5th European symposium on Programming, Edinburgh, GB, April 11--13, 1994. Proceedings
- Complete sets of unifiers and matchers in equational theories
- A Minimum Solution of a Diophantine Equation
- A Proposal for an Extended Form of Type Checking of Expressions
- Algorithm and bound for the greatest common divisor of n integers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item