Subtyping recursive types modulo associative commutative products

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 179-193

  Di Cosmo, Roberto ^a   Pottier, François ^b   Rémy, Didier ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SCIENCE; DECISION THEORY; DIGITAL LIBRARIES; OBJECT ORIENTED PROGRAMMING; QUERY LANGUAGES; RECURSIVE FUNCTIONS;

CLASS INTERFACES; COMMUTATIVE PRODUCTS; OBJECT-ORIENTED LIBRARIES; SUBTYPING RECURSIVE TYPES;

FORMAL LOGIC;

EID: 24944460305     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_14     Document Type: Conference Paper

References (25)

1. Martín Abadi and Marcelo P. Fiore. Syntactic considerations on recursive types. In IEEE Symposium on Logic in Computer Science (LICS), pages 242-252, July 1996.
2. Roberto M. Amadio and Luca Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, September 1993.
3. Maria-Virginia Aponte and Roberto Di Cosmo. Type isomorphisms for module signatures. In Symposium on Programming Language Implementation and Logic Programming (PLILP), volume 1140 of Lecture Notes in Computer Science, pages 334-346. Springer Verlag, 1996.
4. Joshua Auerbach, Charles Barton, and Mukund Raghavachari. Type isomorphisms with recursive types. Technical Report RC 21247, IBM Yorktown Heights, 1998.
5. Joshua Auerbach and Mark C. Chu-Carrol. The Mockingbird system: a compiler-based approach to maximally interoperable distributed systems. Technical Report RC 20718, IBM Yorktown Heights, 1997.
6. Joshua Auerbach, Mark C. Chu-Carrol, Charles Barton, and Mukund Raghavachari. Mockingbird: Flexible stub generation from pairs of declarations. Technical Report RC 21309, IBM Yorktown Heights, 1998.
7. Vincent Balat, Roberto Di Cosmo, and Marcelo Fiore. Remarks on isomorphisms in typed lambda calculi with empty and sum type. In IEEE Symposium on Logic in Computer Science (LICS), July 2002.
8. Charles M. Barton. M-types and their coercions. Technical Report RC-21615, IBM Yorktown Heights, December 1999.
9. Michael Brandt and Fritz Henglein. Coinductive axiomatization of recursive type equality and subtyping. Fundamenta Informaticæ, 33:309-338, 1998.
10. Kim Bruce, Roberto Di Cosmo, and Giuseppe Longo. Provable isomorphisms of types. Mathematical Structures in Computer Science, 2(2):231-247, 1992.
11. Felice Cardone. A coinductive completeness proof for the equivalence of recursive types. Theoretical Computer Science, 275(1-2):575-587, 2002.
12. Bruno Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25(2):95-169, March 1983.
13. Roberto Di Cosmo. Deciding type isomorphisms in a type assignment framework. Journal of Functional Programming, 3(3):485-525, 1993.
14. Roberto Di Cosmo. Isomorphisms of types: from λ-calculus to information retrieval and language design. Progress in Theoretical Computer Science. Birkhauser, 1995.
15. Peter J. Downey, Ravi Sethi, and Robert Endre Tarjan. Variations on the common subexpression problem. Journal of the ACM, 27(4):758-771, October 1980.
16. Vladimir Gapeyev, Michael Levin, and Benjamin Pierce. Recursive subtyping revealed. Journal of Functional Programming, 12(6):511-548, 2003.
17. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225-231, December 1973.
18. Somesh Jha, Jens Palsberg, and Tian Zhao. Efficient type matching. In International Conference on Foundations of Software Science and Computation Structures (FOSSACS), volume 2303 of Lecture Notes in Computer Science, pages 187-204. Springer Verlag, April 2002.
19. Jens Palsberg and Tian Zhao. Efficient and flexible matching of recursive types. Information and Computation, 171:364-387, 2001.
20. Mikael Rittri. Using types as search keys in function libraries. Journal of Functional Programming, 1(1):71-89, 1991.
21. Mikael Rittri. Retrieving library functions by unifying types modulo linear isomorphism. RAIRO Theoretical Informatics and Applications, 27(6):523-540, 1993.
22. Colin Runciman and Ian Toyn. Retrieving re-usable software components by polymorphic type. Journal of Functional Programming, 1(2):191-211, 1991.
23. Sergei V. Soloviev. The category of finite sets and cartesian closed categories. Journal of Soviet Mathematics, 22(3):1387-1400, 1983.
24. Satish R. Thatté. Automated synthesis of interface adapters for reusable classes. In ACM Symposium on Principles of Programming Languages (POPL), pages 174-187, January 1994.
25. Jeannette M. Wing, Eugene Rollins, and Amy Moormann Zaremski. Thoughts on a Larch/ML and a new application for LP. In First International Workshop on Larch, pages 297-312, July 1992.