A Decision Algorithm for Linear Isomorphism of Types with Complexity Cn(log2(n))
AbstractIt is known that ordinary isomorphisms (associativity and commutativity
of "times", isomorphisms for "times" unit and currying)
provide a complete axiomatisation for linear isomorphism of types.
One of the reasons to consider linear isomorphism of types instead of
ordinary isomorphism was that better complexity could be expected.
Meanwhile, no upper bounds reasonably close to linear were obtained.
We describe an algorithm deciding if two types are linearly isomorphic
with complexity Cn(log2(n)).
How to Cite
Andreev, A., & Soloviev, S. (1996). A Decision Algorithm for Linear Isomorphism of Types with Complexity Cn(log2(n)). BRICS Report Series, 3(46). https://doi.org/10.7146/brics.v3i46.20048
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.