Abstract
It is known, that ordinary isomorphisms (associativity and commutativity of “times”, isomorphisms for “times” unit and currying) provide a complete axiomatisation of isomorphism of types in multiplicative linear lambda calculus (isomorphism of objects in a free symmetric monoidal closed category). 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 reasonnably close to linear were obtained. We describe an algorithm deciding if two types are linearly isomorphic with complexity O(nlog 2(n)).
The main part of this research was done while both authors were visiting Computer Science Department of Aarhus University; the visits being funded by BRIGS, a Centre of the Danish National research Foundation, and the european CLICS grant (for the second author). Final version of this paper was done by S.Soloviev while employed by Durham University and funded by British ESPRC grant (on leave from S. Petersburg Institute for Informatics RAN).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Rittri. Retrieving library functions by unifying types modulo linear isomorphism. Proceedings of Conference on Lisp and Functional Programming, 1992.
R. DiCosmo. Isomorphism of Types: from λ-calculus to information retrieval and language design.-Birkhauser, 1995.
S. V. Soloviev. The category of finite sets and cartesian closed categories. Zapiski Nauchnych Seminarov Leningradskogo Otdelenya Matematicheskogo Instituta im. V.A. Steklova AN SSSR, 105 (1981), 174–194. (English translation in: Journal of Soviet Mathematics, 22(3)(1983), 1387–1400.
K. Bruce, R. Di Cosmo and G. Longo. Provable isomorphism of types. Preprint LIENS-90-14, Ecole Normale Superieure, Paris (1990).
G.E. Mints. Closed categories and Proof Theory.J.Soviet Math., 15 (1981), 45–62.
G.-Y. Girard, Y. Lafont. Linear logic and lazy computation. In: Proc.TAPSOFT 87 (Pisa), v.2, p.52–66, Lecture Notes in Comp.Sci. 250 (1987).
S.V. Soloviev. A complete axiom system for isomorphism of types in closed categories. — Lecture Notes in Artificial Intelligence, 698 (1993), 380–392.
P.H. Benton, G.M. Bierman, V.C.V. de Paiva and J.M.E. Hyland. A term calculus for Intuitionistic Linear Logic. — In Proceedings of Typed Lambda calculus and Applications, Lecture Notes in Comp.Sci., 664 (1992), 75–90. *** DIRECT SUPPORT *** A0008C33 00005
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andreev, A., Soloviev, S. (1997). A deciding algorithm for linear isomorphism of types with complexity O(nlog 2(n)).. In: Moggi, E., Rosolini, G. (eds) Category Theory and Computer Science. CTCS 1997. Lecture Notes in Computer Science, vol 1290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026989
Download citation
DOI: https://doi.org/10.1007/BFb0026989
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63455-3
Online ISBN: 978-3-540-69552-3
eBook Packages: Springer Book Archive