| R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universit#t M#nchen, 1994. Also available as report TUM-I9444, Technische Universit#t M#nchen. |
....type for each term. An extension of type classes to predicated (or qualified) types was investigated in [712] Qualified types allow to qualify the sort variables by predicates. For this kind of polymorphism, type inference is semi decidable. In order to deal with inheritance and subtyping [433] develops a polymorphic type discipline with conditional types and a restricted form of union and intersection types. This typing system is shown to be decidable and a type inference algorithm is given which computes the least type of a term. Within the Rapide project [680] 545] 546] the ....
....the type reconstruction problem for a restricted case of TOFL [796] 4.3.7 Combination of Functional and Concurrent Object oriented Programming [637] presents an algebraic approach to specifying object oriented, reactive systems. An implicitly typed lambda calculus for objects is developed in [433]. This calculus views objects as extendible case functions (message interpreters) rather than as extendible records. This view allows to unify the concepts of function, object and process into one concept, that of a functional entity which is self contained and provided with a uniform ....
[Article contains additional citation context not shown here]
R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universitat Munchen, 1994. Technical Report TUM-I9444. \Phi.
No context found.
R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universit#t M#nchen, 1994. Also available as report TUM-I9444, Technische Universit#t M#nchen.
No context found.
R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universitat Munchen, 1994. Also available as report TUMI9444, Technische Universitat Munchen.
....semantic level) The reasons are quite simple. First, we want to model reactive systems and for such systems real time plays an important role. Second, in an untimed input output model one cannot define and understand the privacy invariant. The ideas on mobility of the first author originated in [Gro94] In that work he defined a semantic model for mobile, deterministic data flow networks. However, that model is higher order and mobility is achieved by communicating channels and functions instead of ports. Bro95] and [Gro94] give also an equational characterization of dynamic reconfiguration. ....
....invariant. The ideas on mobility of the first author originated in [Gro94] In that work he defined a semantic model for mobile, deterministic data flow networks. However, that model is higher order and mobility is achieved by communicating channels and functions instead of ports. Bro95] and [Gro94] give also an equational characterization of dynamic reconfiguration. Mobility in the more general framework of nondeterministic systems and where reconfiguration is achieved by sending ports was studied thereafter in [GS95, GS96a, GSB97, GS96b] This article compares and unifies the models given ....
R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universitat Munchen, 1994. Also available as report TUM-I9444, Technische Universitat Munchen.
....the model more abstract, but at the same time more complex with respect to its theoretical basis. The formulation of pulse drivenness has been taken from [Bro95a] and the use of named communication histories is based on [BD92] Our ideas on mobility have also had several sources. Bro95b] and [Gro94] give an equational characterization of dynamic reconfiguration. Gro94] also presents a semantic model for mobile, deterministic networks. However, that model is higher order and mobility is achieved by communicating channels and functions instead of ports. The idea of communicating names (ports) ....
....to its theoretical basis. The formulation of pulse drivenness has been taken from [Bro95a] and the use of named communication histories is based on [BD92] Our ideas on mobility have also had several sources. Bro95b] and [Gro94] give an equational characterization of dynamic reconfiguration. [Gro94] also presents a semantic model for mobile, deterministic networks. However, that model is higher order and mobility is achieved by communicating channels and functions instead of ports. The idea of communicating names (ports) was inspired by [MPW92a, MPW92b] The action structures [Mil92] are ....
R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universitat Munchen, 1994. Also available as report TUMI9444, Technische Universitat Munchen.
....relations and can basically handle only bounded nondeterminism. Kok87] employs an automaton to generate the behaviours of basic agents. This guarantees the existence of x points also in the unbounded case. GS96a] employs sets of strongly guarded (ideterministicj) functions for the same purpose. [Gro94, Bro95] give equational characterisations of dynamic channel conguration with respect to stream processing functions. Several researchers have recently proposed denotational semantics for dynamic channel conguration in the context of the calculus (see for example [JJ95, Sta96] 76 Selected papers ....
R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universit#t M#nchen, 1994. Also available as report TUM-I9444, Technische Universit#t M#nchen.
....metric on relations, he can basically handle only bounded nondeterminism. In [Kok87] which is not based on metric spaces, an automaton is used to generate the behaviors of basic agents. This guarantees the existence of fix points. We use sets of strongly guarded functions for the same purpose. Gro94, Bro95b] give equational characterizations of dynamic reconfiguration with respect to stream processing functions. 8 Acknowledgments The authors would like to thank Manfred Broy for many inspiring discussions on this and related topics. The first author has been financially supported by the ....
R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universitat Munchen, 1994. Also available as report TUM-I9444, Technische Universitat Munchen.
....that the merge nodes used in the definition of composition are undelay has no impact in the context of Brock Ackermann since they are weakly guarded and used in such a way that the resulting network is guaranteed to be strongly guarded 4 . The ideas on mobility of the first author originated in [Gro94] In that work he defined a semantic model for mobile, deterministic data flow networks. However, that model is higher order and mobility is achieved by communicating channels and functions instead of ports. Bro95] and [Gro94] give also an equational characterization of dynamic reconfiguration. ....
....guarded 4 . The ideas on mobility of the first author originated in [Gro94] In that work he defined a semantic model for mobile, deterministic data flow networks. However, that model is higher order and mobility is achieved by communicating channels and functions instead of ports. Bro95] and [Gro94] give also an equational characterization of dynamic reconfiguration. Mobility in the more general framework of nondeterministic systems and where reconfiguration is achieved by sending ports was studied thereafter in [GS95, GS96b, GSB97, GS96a] This article compares and unifies the models given ....
R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universitat Munchen, 1994. Also available as report TUM-I9444, Technische Universitat Munchen.
....may be passed between programs. In higher order (HO) calculus, not only channel identifiers, but also whole processes may move along channels. This corresponds to passing clones in object oriented languages. As in CCS, communication is done synchronously using handshaking. DYNAMIC FOCUS [32, 33, 34, 35]: This approach extends FOCUS similar to the way calculus extends CCS by allowing channel names to be passed between processes. This leads to a new, denotational understanding of dynamics as a set of privacy invariants that have to be maintained by the interacting processes. As in FOCUS, ....
R. Grosu, "A formal foundation for concurrent object oriented programming," Phd Thesis TUM-I9444, Institut fur Informatik, TU Munchen, Arcisstr. 21, D--80290 Munchen, Germany, Nov. 1994.
....formulation of pulse drivenness has been taken from [Bro95a] and the use of named communication histories is based on [BD92] The use of closed sets of functions to model dataflow components is not new see for example [Rus90] Our ideas on mobility have also had several sources. Bro95b] and [Gro94] give an equational characterization of dynamic reconfiguration. Gro94] also presents a semantic model for mobile, deterministic networks. However, that model is higher order and mobility is achieved by communicating channels and functions instead of ports. The idea of communicating names ....
....of named communication histories is based on [BD92] The use of closed sets of functions to model dataflow components is not new see for example [Rus90] Our ideas on mobility have also had several sources. Bro95b] and [Gro94] give an equational characterization of dynamic reconfiguration. Gro94] also presents a semantic model for mobile, deterministic networks. However, that model is higher order and mobility is achieved by communicating channels and functions instead of ports. The idea of communicating names (ports) was inspired by [MPW92a, MPW92b] The action structures [Mil92] are ....
R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universitat Munchen, 1994. Also available as report TUM-I9444, Technische Universitat Munchen.
No context found.
R. Grosu. A formal foundation for concurrent object-oriented programming. Dissertation, Fakultat fur Informatik, Technische Universitat Munchen, December 94.
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