Efficient type matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2303, Issue , 2002, Pages 187-204

  Jha, Somesh ^a   Palsberg, Jens ^b   Zhao, Tian ^b  

^a University of Wisconsin Madison   (United States)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER SOFTWARE; INTEROPERABILITY; JAVA PROGRAMMING LANGUAGE;

MATCHING PROBLEMS; RECURSIVE TYPES; SUBTYPINGS; TIME ALGORITHMS;

APPLICATION PROGRAMS;

EID: 84948991751     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (22)

1. Roberto M. Amadio and Luca Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575–631, 1993. Also in Proceedings of POPL’91.
2. Joshua Auerbach, Charles Barton, and Mukund Raghavachari. Type isomorphisms with recursive types. Research report RC 21247, IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY, August 1998.
3. Joshua Auerbach and Mark C. Chu-Carroll. 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, February 1997.
4. Daniel J. Barrett, Alan Kaplan, and Jack C. Wileden. 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.
5. B. Boehm and B. Scherlis. Megaprogramming. In Proceedings of DARPA Software Technology Conference, April 28-30, Meridien Corporation, Arlington, VA 1992.
6. Michael Brandt and Fritz Henglein. Coinductive axiomatization of recursive type equality and subtyping. In Proceedings of TLCA’97, 3rd International Conference on Typed Lambda Calculus and Applications, 1997.
7. Kim B. Bruce, Roberto Di Cosmo, and Giuseppe Longo. Provable isomorphisms of types. Mathematical Structures in Computer Science, 2(2):231–247, 1992.
8. Luca Cardelli and Peter Wegner. Onunderstanding types, data abstraction, and polymorphism. ACM Computing Surveys, 17(4):471–522, December 1985.
9. Mario Coppo. Type inference with recursive type equations. In Proceedings of FOSSACS’01, Foundations of Software Science and Computation Structures, pages 184–198. Springer- Verlag (LNCS 2030), 2001.
10. Roberto Di Cosmo. Isomorphisms of Types: from λ-calculus to information retrieval and language design. Birkhäuser, 1995.
11. Bruno Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25(1):95–169, 1983.
12. Trevor Jim and Jens Palsberg. Type inference in systems of recursive types with subtyping. Manuscript, 1997.
13. Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient recursive subtyping. Mathematical Structures in Computer Science, 5(1):113–125, 1995. Preliminary version in Proceedings of POPL’93, Twentieth Annual SIGPLAN–SIGACT Symposium on Principles of Programming Languages, pages 419–428, Charleston, South Carolina, January 1993.
14. Paliath Narendran, Frank Pfenning, and Richard Statman. On the unification problem for Cartesian closed categories. In Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, pages 57–63. IEEE Computer Society Press, 1993.
15. OMG. The common object request broker: Architecture and specification. Technical report, Object Management Group, 1999. Version 2.3.1.
16. Robert Paige and Robert Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973–989, December 1987.
17. Jens Palsberg and Tian Zhao. Efficient and flexible matching of recursive types. Information and Computation, to appear. Preliminary version in Proceedings of LICS’00, Fifteenth Annual IEEE Symposium on Logic in Computer Science, pages 388–398, Santa Barbara, California, June 2000.
18. Mikael Rittri. Retrieving library identifiers via equational matching of types. In M. E. Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, volume 449 of LNAI, pages 603–617, Kaiserslautern, FRG, July 1990. Springer Verlag.
19. Mikael Rittri. Using types as search keys in function libraries. Journal of Functional Programming, 1(1):71–89, 1991.
20. Mikael Rittri. Retrieving library functions by unifying types modulo linear isomorphism. RAIRO Theoretical Informatics and Applications, 27(6):523–540, 1993.
21. Sergei V. Soloviev. The category of finite sets and cartesian closed categories. Journal of Soviet Mathematics, 22:1387–1400, 1983.
22. G. Wiederhold, P. Wegner, and S. Ceri. Towards Megaprogramming: A paradigm for component-based programming. Communications of the ACM, 35(11):89–99, November 1992.