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 related types.

If software components are written in different programming languages, communication between the components can become problematic. The study of multilanguage interoperability attempts to bridge the communication barriers that arise between software components due to language differences. Many approaches to multilanguage interoperability have been proposed and implemented, such as remote procedure calls, message-passing, foreign type systems (e.g., CORBA), and databases with application programming interfaces for different languages. A significant shortcoming of such approaches is their lack of seamlessness, or transparency of interoperability. Components may require heavy modification in order to interoperate via these approaches; and...

Abstract not found

Object-oriented tools for advanced applications (an extended abstract)

Abstract not found

Pós-graduação em Engenharia de

Bridging the language gap