On the unification problem for Cartesian closed categories

Journal of Symbolic Logic

Volumn 62, Issue 2, 1997, Pages 636-647

  Narendran, Paliath ^a   Pfenning, Frank ^b   Statman, Richard ^c  

^a State University of New York   (United States)

^b Carnegie Mellon University   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031505860     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275552     Document Type: Article

References (25)

1. K. B. BRUCE, R. DI COSMO, and G. LONGO, Provable isomorphisms of types, Mathematical Structures in Computer Science, vol. 2 (1992), no. 2, pp. 231-247.
2. LUIS CAIRES and LUIS MONTEIRO, Higher-order polymorphic unification for logic programming, Proceedings of the eleventh international conference on logic programming (Pascal Van Hentenryck, editor), MIT Press, 1994, pp. 419-433.
3. N. DERSHOWITZ and JEAN-PIERRE JOUANNAUD, Rewrite systems, Handbook of theoretical computer science (J. van Leeuwen, editor), vol. B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 243-320.
4. R. DI COSMO, Type isomorphisms in a type assignment framework, Annual ACM symposium on the principles of programming languages, ACM, 1992, pp. 200-210.
5. _, Isomorphisms of types, Ph.D. thesis, Dipartimento di Informatica, Universita di Pisa, 1993.
6. FRANÇOIS FAGES, Associative-commutative unification, Journal of Symbolic Computation, vol. 3 (1987), pp. 257-275.
7. ULLRICH HUSTADT, A complete transformation system for polymorphic higher-order unification, Technical Report MPI-I-91-228, Max-Planck-Institut für Informatik, Saarbrücken, Germany, December 1991.
8. JEAN-PIERRE JOUANNAUD and HELENE KIRCHNER, Completion of a set of rules modulo a set of equations, SIAM Journal of Computing, vol. 15 (1986), no. 4, pp. 1155-1194.
9. DEEPAK KAPUR and PALIATH NARENDRAN, Complexity of unification problems with associative-commutative operators, Journal of Automated Reasoning, vol. 9 (1992), no. 2, pp. 261-288.
10. J. W. KLOP, Term rewriting systems: a tutorial, Bulletin of the EATCS, vol. 32 (1987), pp. 143-182.
11. J. LAMBEK and P. J. SCOTT, Introduction to higher order categorical logic, Cambridge University Press, Cambridge, England, 1986.
12. PALIATH NARENDRAN, FRANK PFENNING, and RICHARD STATMAN, On the unification problem for Cartesian closed categories, talk presented at the workshop on higher-order logic in Banff, Alberta, September 1989.
13. _, On the unification problem for Cartesian closed categories, Proceedings of the eighth annual symposium on logic in computer science (Moshe Vardi, editor), IEEE Press, 1993.
14. TOBIAS NIPKOW, Higher-order unification, polymorphism and subsorts, Proceedings of the second international workshop on conditional and typed rewriting systems (S. Kaplan and M. Okada, editors), Lecture Notes in Computer Science, no. 516, Springer-Verlag, 1990.
15. G. E. PETERSON and M. E. STICKEL, Complete sets of reductions for some equational theories, Journal of the ACM, vol. 28 (1981), no. 3, pp. 233-264.
16. MIKAEL RITTRI, Retrieving library identifiers via equational matching of types, Proceedings of the tenth international conference on automated deduction (M. E. Stickel, editor), Lecture Notes in Artificial Intelligence, no. 449, Springer-Verlag, 1990, pp. 603-617.
17. _, Using types as search keys in function libraries, Journal of Functional Programming, vol. 1 (1991), no. 1, pp. 71-89, A preliminary version appeared in the proceedings of FPCA '89, pages 174-183.
18. _, Using types as search keys in function libraries, Journal of Functional Programming, vol. 1 (1991), no. 1, pp. 71-89, A preliminary version appeared in the proceedings of FPCA '89, pages 174-183.
19. _, Retrieving library functions by unifying types modulo linear isomorphism, Programming Methodology Group Report 66, Chalmers University of Technology and University of Göteborg, Göteborg, Sweden, May 1992.
20. _, Retrieving library functions by unifying types modulo linear isomorphism, RAIRO Theoretical Informatics and Applications, vol. 27 (1993), no. 6, pp. 523-540.
21. COLIN RUNCIMAN and IAN TOYN, Retrieving re-usable software components by polymorphic type, Journal of Functional Programming, vol. 1 (1991), no. 2. pp. 191-211, A preliminary version appeared in the proceedings of FPCA '89, pages 166-173.
22. COLIN RUNCIMAN and IAN TOYN, Retrieving re-usable software components by polymorphic type, Journal of Functional Programming, vol. 1 (1991), no. 2. pp. 191-211, A preliminary version appeared in the proceedings of FPCA '89, pages 166-173.
23. SERGEI V. SOLOVIEV, The category of finite sets and Cartesian closed categories, Soviet Mathematics, vol. 22 (1983), no. 3, pp. 1387-1400.
24. _, The ordinary identities form a complete axiom system for isomorphism of types in closed categories, Proceedings of the international conference on logic programming and automated reasoning (A. Voronkov, editor), Lecture Notes in Artificial Intelligence, no. 698, Springer-Verlag, 1993, pp. 360-371.
25. MARK STICKEL, A unification algorithm for associative-commutative functions, Journal of the ACM, vol. 28 (1981), no. 3, pp. 423-434.