Abstract
A substitution σ AG-semi-unifies the inequation s ⩽ ? AG t iff there is another substitution ϱ such that ϱ( σ( s)= AG σ( t), where = AG is equality in Abelian groups. We give an algorithm that decides if an inequation has an AG-semi-unifier and, if so, returns a most general one. This is a first step towards type derivation in programming languages with dimension types and polymorphic recursion.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call