Abstract

Abstract
Constructor subtyping is a form of subtyping in which an inductive type sigma is viewed as a subtype of another inductive type tau if tau has more constructors than sigma. As suggested in [5, 12], its (potential) uses include proof assistants and functional programming languages. In this paper, we introduce and study the properties of a simply typed lambda-calculus with record types and datatypes, and which supports record subtyping and constructor subtyping. In the first part of the paper, we show that the calculus is confluent and strongly normalizing. In the second part of the paper, we show that the calculus admits a well-behaved theory of canonical inhabitants, provided one adopts expansive extensionality rules, including eta-expansion, surjective pairing, and a suitable expansion rule for datatypes. Finally, in the third part of the paper, we extend our calculus with unbounded recursion and show that confluence is preserved.

Abstract
This chapter contains summaries of the presentations given at the Intercontinental Workshop on Aliasjng in Object-Oriented Systems (IWAOOS'99) at the European Conference on Object-Oriented Programming (ECOOP'99) which was held in Lisbon, Portugal on June 15, 1999.

Abstract
Current data abstraction mechanisms are not adequate to control sharing of state in the general case involving objects in linked structures. The pervading possibility of sharing is a source of errors and an obstacle to language implementation techniques. Balloon types, which we have introduced in [2], are a general extension to programming languages. They make the ability to share state a first class property of a data type. The balloon invariant expresses a strong form of encapsulation: no state reachable (directly or transitively) by a balloon object is referenced by any external object. In this paper we describe the checking mechanism for balloon types. It relies on a non-trivial static analysis, described as an abstract interpretation. Here we focus in particular on the design of the abstract domain which allows the checking mechanism to work under realistic assumptions regarding possible object aliasing. ©1999 Published by Elsevier Science B. V.

Abstract
In the last few years, information outsourcing has been a current activity on large companies. Information as become a regular trading commodity. It is a well known fact that direct mailing companies acquire databases, or other kind of information sources, from other companies with names and addresses of potential clients. Also, enterprise managers are frequently concerned with the current status and welfare of their clients and suppliers. Commonly, they use to appeal to specialized external information providers which may, under certain conditions, provide them specific profiles about such potential commercial partners. On companies with effective means of information processing, it is very probable that such needs of information may be directly satisfied with data stored and managed in the companies' data warehouses. In this paper we propose a protocol based on economic principles that enables the automatic negotiation of information transference between data warehouse systems of different companies. The protocol was designed to be used by a community of intelligent agents responsible to ensure and support all the operational tasks related to information outsourcing among companies.

Abstract