Retrieving library functions by unifying types modulo linear isomorphism

 Access to full text

 Full (PDF)

1. 0. L. AUGUSTSSON and T. JOHNSSON, The Chalmers Lazy-ML Compiler, Computer Journal, 1989, 32, pp. 127-141 
2. 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. Zbl0708.68021MR1077006
3. 2. G. BIRKHOFF, On the Structure of Abstract Algebras, Proc. Cambridge Philos. Soc., 1935, 31, pp. 433-454. Zbl0013.00105JFM61.1026.07
4. 3. N. BOUDRIGA, A. MILI and R. MITTERMEIR, Semantic-based Software Retrieval to Support Rapid Prototyping, Structured Programming, 1992, 13, pp. 109-127. Zbl0761.68028
5. 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. Zbl0763.03011MR1171511
6. 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. 
7. 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). MR1279733
8. 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). 
9. 8. J.-Y. GIRARD, Linear logic, Theoretical Computer Science, 1987, 50, pp. 1-102. Zbl0625.03037MR899269
10. 9. Y. LAFONT, The Linear Abstract Machine, Theoretical Computer Science, 1988, 59, pp. 157-180, with corrigenda, 62, pp. 327-328. Zbl0648.68016MR968905
11. 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. MR592812
12. 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. 
13. 12. S. MAC LANE, Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics, Springer-Verlag, 1971. Zbl0232.18001MR1712872
14. 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). 
15. 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. 
16. 15. R. MORGAN, Component Library Retrieval using Property Models, PhD thesis, SEAS, Univ. of Durham, England, DH1 3LE (rick@easby.dur.ac.uk), 1991. 
17. 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. Zbl0882.03044
18. 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). Zbl1155.68452MR1110293
19. 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. MR1077026
20. 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. 
21. 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). Zbl0941.68547MR1110297
22. 21. J. H. SIEKMANN, Unification Theory, J. Symbolic Computation, 1989, 7, pp. 207-274. Zbl0678.68098MR993666
23. 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). Zbl0474.18003MR628986
24. 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).