Semi-unification of two terms in Abelian groups

DOI10.1016/0020-0190(94)00127-8zbMATH Open0821.68070OpenAlexW2029734017MaRDI QIDQ1336738FDOQ1336738

Authors: Mikael Rittri 

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

Recommendations

• scientific article; zbMATH DE number 3885353
• Unification in abelian semigroups
• Semi-unification
• scientific article; zbMATH DE number 4092757
• Unification in commutative semigroups

zbMATH Keywords

compilersdimension typesequational semi-unificationpolymorphic recursion

Mathematics Subject Classification ID

Theory of programming languages (68N15) Symbolic computation and algebraic computation (68W30) Abelian groups (20K99)

Cites Work

• Title not available (Why is that?)
• The undecidability of the semi-unification problem
• Title not available (Why is that?)
• Algorithm and bound for the greatest common divisor of n integers
• Title not available (Why is that?)
• Unification theory
• Complete sets of unifiers and matchers in equational theories
• Title not available (Why is that?)
• A Proposal for an Extended Form of Type Checking of Expressions
• Programming languages and systems - ESOP '94. 5th European symposium on Programming, Edinburgh, GB, April 11--13, 1994. Proceedings
• A Minimum Solution of a Diophantine Equation

Cited In (2)

• Unification in commutative semigroups
• Title not available (Why is that?)

This page was built for publication: Semi-unification of two terms in Abelian groups

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