Roberto Di Cosmo, Francois Pottier, Didier Remy  Home/Search
Context
Related
| pauillac.inria.fr/...remyicfp03.ps.gz pauillac.inria.fr/...tierremy03.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pauillac.inria.fr/~fpot...pottier (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study subtyping of recursive types in the presence of associative and commutative products---that is, subtyping modulo a restricted form of type isomorphisms. We show that this relation, which we claim is useful in practice, is a composition of the usual subtyping relation with the recently proposed notion of equality up to associativity and commutativity of products, and we propose an efficient decision algorithm for it. We also provide an automatic way of constructing coercions between... (Update)
Similar documents (at the sentence level):
68.7%: Subtyping Recursive Types modulo Associative Commutative.. - Di Cosmo, Pottier, Remy (2003) (Correct)
Active bibliography (related documents): More All
1.3: Efficient Algorithms for Isomorphisms of Simple Types - Yoav Zibin Zyoav (Correct)
0.8: Remarks on Isomorphisms in Typed Lambda Calculi with.. - Fiore, Di Cosmo, Balat (2002) (Correct)
0.7: Efficient Type Matching - Jha, Palsberg, Zhao (2002) (Correct)
Similar documents based on text: More All
0.3: A Linear Logical View of Linear Type Isomorphisms - Balat, Di Cosmo (1999) (Correct)
0.3: Type Isomorphisms with Recursive Types - Auerbach, Barton, Raghavachari (1998) (Correct)
0.2: Efficient and Flexible Matching of Recursive Types - Palsberg, Zhao (2000) (Correct)
BibTeX entry: (Update)
@misc{ cosmo-subtyping,
author = "Roberto Di Cosmo and Francois Pottier and Didier Remy",
title = "Subtyping Recursive Types modulo Associative Commutative Products",
url = "citeseer.ist.psu.edu/dicosmo03subtyping.html" }
Citations (may not include all citations):185 algorithm for maximum matchings in bipartite graphs (context) - Hopcroft, Karp - 1973
129 ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
114 Fundamental properties of infinite trees (context) - Courcelle - 1983
82 Variations on the common subexpression problem (context) - Downey, Sethi et al. - 1980
42 Using types as search keys in function libraries (context) - Rittri - 1991
38 Coinductive axiomatization of recursive type equality and su.. - Brandt, Henglein - 1997
30 Mathematical Structures in Computer Science (context) - Bruce, Di Cosmo et al. - 1992
25 Retrieving re-usable software components by polymorphic type - Runciman, Toyn - 1991
17 The category of finite sets and cartesian closed categories (context) - Soloviev - 1983
13 Retrieving library functions by unifying types modulo linear.. - Rittri - 1993
12 Syntactic considerations on recursive types - Abadi, Fiore - 1996
12 Isomorphisms of types: from - calculus to information retri.. (context) - Di Cosmo - 1995
11 Type isomorphisms with recursive types - Auerbach, Barton et al. - 1998
10 Recursive subtyping revealed - Gapeyev, Levin et al. - 2000
5 The Mockingbird system: a compiler-based approach to maximal.. - Auerbach, Chu-Carrol - 2071
4 interoperability and naming in object-oriented databases (context) - Kaplan, Support et al.
4 Efficient and flexible matching of recursive types - Palsberg, Zhao - 2000
4 Remarks on isomorphisms in typed lambda calculi with empty a.. - Balat, Di Cosmo et al. - 2002
4 Type isomorphisms for module signatures (context) - Aponte, Di Cosmo - 1996
3 Deciding type isomorphisms in a type assignment framework (context) - Di Cosmo - 1993
3 Thought LarchML and new application LP (context) - Rollins, on et al. - 1992
3 Efficient type matching - Jha, Palsberg et al. - 2002
2 Technical Report RC (context) - Barton, their - 1999
2 Maintaining bipartite matchings in the presence of failures - Sha, Steiglitz - 1993
2 Mockingbird: Flexible stub generation from pairs of declarat.. (context) - Auerbach, Chu-Carrol et al. - 1998
2 Definable properties in general algebra (context) - Beki - 1984
2 Signature subtyping modulo type isomorphisms (context) - Aponte, Di Cosmo et al. - 1998
2 A survey of isomorphisms of types (context) - Di Cosmo
Documents on the same site (http://pauillac.inria.fr/~fpottier/biblio/pottier.html): More
Information Flow Inference For Free - Pottier, Conchon (2000) (Correct)
A 3-Part Type Inference Engine - Pottier (2000) (Correct)
An Implementation Of Caml-Light With Existential Types - Mauny, Pottier (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC