no. 6
Retrieving library functions by unifying types modulo linear isomorphism
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 6, pp. 523-540. 
@article{ITA_1993__27_6_523_0,
     author = {Rittri, M.},
     title = {Retrieving library functions by unifying types modulo linear isomorphism},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {523--540},
     publisher = {EDP-Sciences},
     volume = {27},
     number = {6},
     year = {1993},
     zbl = {0809.68063},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1993__27_6_523_0/}
}
TY  - JOUR
AU  - Rittri, M.
TI  - Retrieving library functions by unifying types modulo linear isomorphism
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1993
SP  - 523
EP  - 540
VL  - 27
IS  - 6
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1993__27_6_523_0/
LA  - en
ID  - ITA_1993__27_6_523_0
ER  - 
%0 Journal Article
%A Rittri, M.
%T Retrieving library functions by unifying types modulo linear isomorphism
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1993
%P 523-540
%V 27
%N 6
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1993__27_6_523_0/
%G en
%F ITA_1993__27_6_523_0
Rittri, M. Retrieving library functions by unifying types modulo linear isomorphism. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 6, pp. 523-540. http://archive.numdam.org/item/ITA_1993__27_6_523_0/

0. L. Augustsson and T. Johnsson, The Chalmers Lazy-ML Compiler, Computer Journal, 1989, 32, pp. 127-141

1. D. A. Basin, Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators is Isomorphism Complete, In M. E. STICKEL Ed., 10th Int. Conf. on Automated Deduction, Kaiserslautern, Germany, Volume 449 of Lecture Notes in Artificial Intelligence, 1990, pp. 251-260, Springer-Verlag. | MR | Zbl

2. G. Birkhoff, On the Structure of Abstract Algebras, Proc. Cambridge Philos. Soc., 1935, 31, pp. 433-454. | JFM

3. N. Boudriga, A. Mili and R. Mittermeir, Semantic-based Software Retrieval to Support Rapid Prototyping, Structured Programming, 1992, 13, pp. 109-127. | Zbl

4. K. B. Bruce, R. Di Cosmo and G. Longo, Provable Isomorphisms of Types, Mathematical Structures in Computer Science, 1992, 2, (2), pp. 231-247. | MR | Zbl

5. M. Carlsson and T. Hallgren, FUDGETS: A Graphical User Interface in a Lazy Functional Language, In Functional Programming Languages and Computer Architecture, Copenhagen, Denmark, 1993.

6. R. Di Cosmo, Type Isomorphisms in a Type-assignment Framework: From Library Searches using Types to the Completion of the ML Type Checker, In 19th ACM Symp. on Principles of Programming Languages, pp. 200-210, ACM Press, 1992, (Revised version to appear in J. Functional Programming). | MR

7. W. B. Frakes (chair), Panel Session: Information Retrieval and Software Reuse, In Proc. 12th Ann. Int. ACMSIGIR Conf. on Research and Development in Information Retrieval, pp. 251-256, Cambridge, Mass., USA, 1989, (Special issue of SIGIR Forum, ACM Press).

8. J.-Y. Girard, Linear logic, Theoretical Computer Science, 1987, 50, pp. 1-102. | MR | Zbl

9. Y. Lafont, The Linear Abstract Machine, Theoretical Computer Science, 1988, 59, pp. 157-180, with corrigenda, 62, pp. 327-328. | MR | Zbl

10. J. Lambek, From Lambda Calculus to Cartesian Closed Categories, In J. P. SELDIN and J. HINDLEY Eds., To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, 1980, pp. 376-402. | MR

11. E. Lindström, Unification in μUTRL. Report UMINF-92.10, Dept Comput. Sci., Univ. of Umeå, S-901 87 Umeå, Sweden (term@cs.umu.se), 1992.

12. S. Mac Lane, Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics, Springer-Verlag, 1971. | MR | Zbl

13. B. Matthews, Reusing Functional Code using Type Classes for Library Search, Presented at the ERCIM Workshop on Software Reuse, Heraklion, Crete, 1992, Author's address: Dept. Comput. Sci., Glasgow Univ., U.K. (brian@dcs.glasgow.ac.uk).

14. L. Meertens and A. Siebes, Universal Type Isomorphisms in Cartesian Closed Catégories - Preliminary Version, Centrum voor Wiskunde en Informatica, Amsterdam, the Netherlands (lambert@cwi.nl and arno@cwi.nl), 1990.

15. R. Morgan, Component Library Retrieval using Property Models, PhD thesis, SEAS, Univ. of Durham, England, DH1 3LE (rick@easby.dur.ac.uk), 1991.

16. P. Narendran, F. Pfenning and R. Statman, On the Unification Problem for Cartesian Closed Categories, In Eighth Annual IEEE Symp. on Logic in Computer Science, 1993.

17. M. Rittri, Using Types as Search Keys in Function Libraries, J. Functional Programming, 1991, 1, (1), pp. 71-89, (Earlier version in Func. Prog. Lang. and Comput. Arch., ACM Press, 1989). | MR | Zbl

18. M. Rittri, Retrieving Library Identifiers via Equational Matching of Types, In M. E. STICKEL Ed., 10th Int. Conf. on Automated Deduction, Kaiserslautern, Germany. Volume 449 of Lecture Notes in Artificial Intelligence, 1990, pp. 603-617, Springer-Verlag. | MR

19. E. J. Rollins and J. M. Wing, Specifications as Search Keys for Software Libraries, In K. FURUKAWA Ed., Eighth Int. Conf. on Logic Programming, MIT Press, 1991, pp. 173-187.

20. C. Runciman and I. Toyn, Retrieving Reusable Software Components by Polymorphic Type, J. Functional Programming, 1991, (2), pp. 191-211, (Earlier version in Func. Prog. Lang. and Comput. Arch., ACM Press, 1989). | MR | Zbl

21. J. H. Siekmann, Unification Theory, J. Symbolic Computation, 1989, 7, pp. 207-274. | MR | Zbl

22. S. V. Soloviev, The Category of Finite Sets and Cartesian Closed Categories, J. Soviet Math., 1983, 22, (3), pp. 1387-1400, (First published in Russian in Zapiski Nauchnykh Seminarov Leningradskogo Otdelenya Matematicheskogo Instituta, 1981, 105, pp. 174-194). | MR | Zbl

23. S. V. Soloviev, The Ordinary Identities Form a Complete Axiom System for Ordinary Isomorphism of Types in Closed Categories, 1991, The Institute for Informatics and Automation of the Academy of Sciences, 199178, St. Petersburg, Russia, e-mail via S. Baranoff, sergei@iias.spb.su. (The author is currently at Aarhus University, Denmark, e-mail: soliviev@daimi.aau.dk).