A Decision Algorithm for Linear Isomorphism of Types with Complexity Cn(log2(n))

Forfattere

  • Alexander E. Andreev
  • Sergei Soloviev

DOI:

https://doi.org/10.7146/brics.v3i46.20048

Resumé

It 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)).

Downloads

Publiceret

1996-06-16

Citation/Eksport

Andreev, A. E., & 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

Nummer

Nr. 46 (1996): RS-46 A Decision Algorithm for Linear Isomorphism of Types with Complexity Cn(log2(n))

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).