V. T. Vasconcelos. Typed concurrent objects. Lecture Notes in Computer Science, 821, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and interface definitions are used informally, and no equivalent notion to our expansion is described. This means there is no explicit way of dealing with inter referential definitions in the context of subtyping. Another system which bears similarity to Oompa is TyCO (Typed Concurrent Objects) [Vas94]. Objects are primitive in TyCO, but class like entities may be defined using a let construction. A corresponding notion of subclassing can similarly be defined. TyCO doesn t have an explicit subtyping system, but a similar e#ect is achieved by making the rule which type checks invocation apply ....

V. T. Vasconcelos. Typed concurrent objects. Lecture Notes in Computer Science, 821, 1994.

....e n ) with d i 2 X i and e i 2 Y i for all i and (e 1 ; e n ) sort(d 1 ; dn ) The task of narrowing the sortedness constraint is to decide whether S is non empty and, if so, to compute the minimal and maximal element in each of its 2n components. Bleuzen Guernalec and Colmerauer [BGC97,BGC00] gave an O(n log n) algorithm for narrowing the sortedness constraint. We relate the problem to matching theory and derive an alternative algorithm. The new algorithm has two advantages over the previous algorithms: it is simpler and its running time is O(n) plus the time required to sort the ....

....are competitive with the best previously known algorithms. Under some circumstances our algorithm have a better asymptotic running time. For example, we can narrow instances of the alldi erent constraint in linear time when the variables encode a permutation. Bleuzen Guernalec and Colmerauer [BGC97] have already noticed that a bound consistency narrowing algorithm for the sortedness constraint can be used for narrowing permutation constraints. We feel that translating both constraints to matching problems in bipartite graphs has made the relationship more obvious, because the matching ....

N. Bleuzen-Guernalec and A. Colmerauer. Narrowing a 2n-block of sortings in O(n log n). Lecture Notes in Computer Science, 1330:2-16, 1997.

.... consists on recasting some well established object calculus and enriching it with concurrent primitives (parallel composition and the operation of scope restriction) BF96, GH98] The second attempts the other way around, trying to extend process calculi with objects by introducing record types [Vas94, DZ98] However, there is an apparent distance among these calculi and concurrent object oriented languages that jeopardizes their utility. The focus in the latters is on classes and inheritance of class definitions while the formers, being object based, largely overlook these issues. ....

V. T. Vasconcelos. Typed concurrent objects. Lecture Notes in Computer Science, 821:100--117, 1994.

.... One consists on recasting some well established object calculus and enriching it with concurrent primitives (parallel composition and the operation of scope restriction) 9, 2, 6] The second attempts the other way around, trying to extend process calculi with objects by introducing record types [11, 4]. There is an apparent distance among these calculi and concurrent object languages which jeopardize their utility. The focus in the latters is on classes and inheritance of class definitions while the formers,being object based calculi, definitely overlook these issues. Regrettable, forgetting ....

Vasco T. Vasconcelos. Typed concurrent objects. Lecture Notes in Computer Science, 821:100--117, 1994.

No context found.

Sympos. Algorithms and Computation #ISAAC'96#, Lecture Notes in Computer Science,Vol. 1178, pp. 126#135. Springer-Verlag, 1996.

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