Efficient and flexible matching of recursive types

Information and Computation

Volumn 171, Issue 2, 2001, Pages 364-387

  Palsberg, Jens ^a   Zhao, Tian ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATIVE PROCESSING; COMPUTER SOFTWARE; INFORMATION RETRIEVAL; SET THEORY; TREES (MATHEMATICS);

MULTILANGUAGE SYSTEMS;

RECURSIVE FUNCTIONS;

EID: 0035895131     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3090     Document Type: Article

References (36)

1. Abadi, M., and Fiore, M. P. (1996), Syntactic considerations on recursive types, in "Proceedings of LICS'96, 11th Annual IEEE Symposium on Logic in Computer Science," pp. 242-252.
2. Amadio, R. M., and Cardelli, L. (1993), Subtyping recursive types, ACM Trans. Programming Languages Systems 15, 575-631. Also in "Proceedings of POPL'91.".
3. Amadio, R. M., and Cardelli, L. (1993), Subtyping recursive types. ACM Trans. Programming Languages Systems 15, 575-631. Also in "Proceedings of POPL'91."
4. 2 (n))," Lecture Notes in Computer Science, Vol. 1290, 197ff, Springer-Verlag, Berlin/New York.
5. Aponte, M.-V., and Di Cosmo, R. (1996), Type isomorphisms for module signatures, in "Proceedings of PLILP '96," Lecture Notes in Computer Science, Vol. 1140, pp. 334-346, Springer-Verlag, Berlin.
6. Auerbach, J., Barton, C., Chu-Carroll, M., and Raghavachari, M. (1999), Mockingbird: Flexible stub compilation from pairs of declarations, in "Proceedings of the 19th International Conference on Distributed Computing Systems," pp. 393-402.
7. Auerbach, J., Barton, C., and Raghavachari, M. (1998), "Type Isomorphisms with Recursive Types," Research Report RC 21247, IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY.
8. Auerbach, J., and Chu-Carroll, M. C. (1997), "The Mockingbird System: A Compiler-Based Approach to Maximally Interoperable Distributed Programming," Research Report RC 20718, IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY.
9. Barrett, D. J., Kaplan, A., and Wileden, J. C. (1996), Automated support for seamless interoperability in polylingual software systems, in "ACM SIGSOFT'96, Fourth Symposium on the Foundations of Software Engineering, San Francisco, California, October 1996."
10. Brandt, M., and Henglein, F. (1997), Coinductive axiomatization of recursive type equality and subtyping, in "Proceedings of TLCA'97, 3rd International Conference on Typed Lambda Calculus and Applications."
11. Bruce, K. B., Di Cosmo, R., and Longo, G. (1992), Provable isomorphisms of types, Math. Structures Comput. Sci. 2, 231-247.
12. Cai, J., and Paige, R. (1995), Using multiset discrimination to solve language processing problems without hashing, Theoret. Comput. Sci. 145, 189-228.
13. Considine, J. (2000), Deciding isomorphisms of simple types in polynomial time, manuscript.
14. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990), "Introduction to Algorithms," MIT Press/McGraw-Hill, Cambridge, MA.
15. Di Cosmo, R. (1995), "Isomorphisms of Types: From λ-Calculus to Information Retrieval and Language Design," Birkhäuser, Basel.
16. Cousot, P. (1981), Semantic foundations of program analysis, in "Program Flow Analysis: Theory and Applications" (S. S. Muchnick and N. D. Jones, Eds.), Chap. 10, pp. 303-342, Prentice-Hall, Englewood Cliffs, NJ.
17. Dowling, W. F., and Gallier, J. H. (1984), Linear-time algorithms for testing the satisfiability of propositional horn formulae, J. Logic Progamming 1, 267-284.
18. Gay, D. E. (1994), Interface definition language conversions: Recursive types, ACM SIGPLAN Notices 29, 101-110.
19. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput. 2, 225-231.
20. Jim, T., and Palsberg, J. (1997), Type inference in systems of recursive types with subtyping, manuscript.
21. Kozen, D. (1994), A completeness theorem for Kleene algebras and the algebra of regular events, Inform. and Comput. 110, 366-390.
22. Kozen, D., Palsberg, J., and Schwartzbach, M. I. (1993), Efficient recursive subtyping, Math. Structures Comput. Sci. 5, 113-125. Preliminary version (1993), in "Proceedings of POPL'93, Twentieth Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, January 1993," pp. 419-428.
23. Kozen, D., Palsberg, J., and Schwartzbach, M. I. (1993), Efficient recursive subtyping, Math. Structures Comput. Sci. 5, 113-125. Preliminary version (1993), in "Proceedings of POPL'93, Twentieth Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, January 1993," pp. 419-428.
24. Milner, R. (1984), A complete inference system for a class of regular behaviors, J. Comput. System Sci. 28, 439-466.
25. Narendran, P., Pfenning, F., and Statman, R. (1993), On the unification problem for Cartesian closed categories, in "Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science," pp. 57-63, IEEE Comput. Soc., Los Alamitos, CA.
26. OMG. (1999), "The Common Object Request Broker: Architecture and Specification," Technical Report, Object Management Group, version 2.3.1.
27. Palsberg, J., and Pavlopoulou, C. (2001), From polyvariant flow information to intersection and union types, J. Funct. Programming 11, 263-317.
28. Park, D. M. R. (1981), Concurrency and automata on infinite sequences, in "Proceedings of the 5th GI Conference," Lecture Notes in Computer Science, Vol. 104, pp. 15-32, Springer-Verlag, Berlin.
29. Rittri, M. (1990), Retrieving library identifiers via equational matching of types, in "Proceedings of the 10th International Conference on Automated Deduction, Kaiserslautern, FRG" (M. E. Stickel, Ed.), Lecture Notes in Artificial Intelligence, Vol. 449, pp. 603-617, Springer-Verlag, Berlin.
30. Rittri, M. (1991), Using types as search keys in function libraries, J. Func. Programming 1, 71-89.
31. Rittri, M. (1993), Retrieving library functions by unifying types modulo linear isomorphism, RAIRO Theoret. Inform. Appl. 27, 523-540.
32. Soloviev, S. (1993), "A Complete Axiom System for Isomorphism of Types in Closed Categories," Lecture Notes in Artificial Intelligence, Vol. 698, pp. 380-392, Springer-Verlag, Berlin.
33. Soloviev, S. V. (1983), The category of finite sets and cartesian closed categories, J. Soviet Math. 22, 1387-1400.
34. Tarski, A. (1955), A lattice-theoretical fixed point theorem and its applications, Pacific J. Math. 5, 285-309.
35. Thatte, S. (1996), Automated synthesis of interface adapters for reusable classes, in "Proceedings of POPL'96, 23nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages," pp. 174-185.
36. Zaremski, A. M., and Wing, J. M. (1995), Signature matching: A tool for using software libraries, ACM Trans. Software Engrg. Method. 4, 146-170.