S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999. 1  Home/Search   Document Details and Download   Summary   Related Articles   Check

....second component of the pair) Quite some e ort is being invested in the study of session types, motivated by the bene ts that such a system provides for the analysis of protocols. Starting from the work of Honda et al. [13] a suitable notion of subtypes for session types has been explored in [7], the bene ts of session types in component based software development was presented in [1] bounded polymorphism in the presence of session types has been studied in [12] session types formulated in a calculus with input ouput operations is considered in [8] This paper addresses a ....

....Congruence (cf. Section 2.2.1 and 3) We show that evaluation preserves typability and that processes typable under empty e ects are safe. Related work. This work may be included among others in which type systems for the calculus are studied [18,17,16,20] More closely to the present work [7] introduces subtyping into session types, however the concept of synchronization between sessions is not explored. The same holds for [22] and [19] the rst studies a typing scheme for processes based on graph types and the second a type system for restricting communication in concurrent objects; ....

Gay, S. and M. Hole, Types and subtypes for client-server interactions, in: Proceedings of the European Symposium on Programming Languages and Systems, number 1576 in LNCS (1999).

....of ideas with similar motivations to di#erent computational models. In concurrent logic programming, the di#culty lies in the treatment of arbitrarily complex information flow expressed using logical variables. Walker discusses types supporting more explicit memory management [50] Session types [13] shares the same objective with our mode system. Languages that feature linearity can be found in various programming paradigms. Linear Lisp [4] and Lilac [20] are two examples outside logic programming, while a survey of linear logic programming languages can be found in [23] There is a lot of ....

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions. In Proc. European Symp. on Programming (ESOP'99), LNCS 1576, Springer-Verlag, 1999, pp. 74--90.

....x[ i2I ( y i ) P i ] j xin j ( y j ) Q ( y j ) P j j Q) 7) where we assume j 2 I , with I (6= denoting a nite or countably in nite indexing set. Accordingly we de ne the rule for replicated branching. Branching constructs of this kind have been studied in tyco [38] and other calculi [13, 16, 18] (the corresponding type structure already appeared in Linear Logic [1, 14] Augmenting the original asynchronous syntax with bound output and branching, we now arrive at the following grammar. P : x( y) P input j P j Q parallel j x( y) P output j ( x)P hiding j x[ i2I ( y i ) P i ] ....

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

....types. Note that then the types should capture causality of actions, as properties like deadlock or even livelock are global properties (and not compositional as it is usually the case of liveness properties) Thus, the types should capture the flow of the processes, being themselves processes [Bou98, GH99, HVK98, IK01, Kob00, Yos96]. Note that some of these systems assign types to processes, not to names. In a name passing calculus of objects such as T yCO [VT93] or # V a [San98] processes denote the behaviour of a community of interacting objects, where each object has a location identified by a name. Statically ....

Simon Gay and Malcolm Hole. Types and subtypes for client-server interactions. In Programming Languages and Systems: Proceedings of the 8th European Symposium on Programming (ESOP'99), Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS'99), Amsterdam, The Netherlands, volume 1576 of Lecture Notes in Computer Science, pages 74--90. Springer-Verlag, 1999.

....to be neglected. This suggests the following principle of behavioural semantics in linear processes. Categorise some of the typed actions as non a ecting , and abstract away non a ecting actions as if they were actions. The type structure plays a crucial role in this principle. Following [6, 11, 15, 18, 33], the linear calculus in [35] includes branching and selection, which correspond to sums in the calculus and additives in Linear Logic [12] A branching is an input with I indexed branches of form x[ i2I ( y i ) P i ] while a selection is an output of form xin i ( z)Q. These constructs have ....

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

....new problems not encountered before in the context of AC. The design of a type discipline enforcing it is a delicate matter. This is one of the challenges we take on in this report. Orderly communication bears a strong resemblance to what has been called session types in the # calculus [GH99] Leaving aside differences between the underlying calculi, orderly communication and session types are both motivated by the need to keep track of the order in which communication events take place. There are nevertheless important differences between the two, which are discussed further in ....

....to orderly communication in AC . Before we do this, we need to briefly recall the system of simple types for the # calculus; along the way we mention several extensions of simple types that have been proposed in the literature. Our presentation is a very brief adaptation of parts in [Gay99] and [GH99] 7.3.1 Simple Types and Extensions. The syntax of processes P in the # calculus can be given by the following grammar: P : 0 P Q x [y] P x [y] P (# x)P P where x and y range over names, and x and y range over lists of names. This is the syntax of the plain ....

[Article contains additional citation context not shown here]

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999.

....new problems not encountered before in the context of AC. The design of a type discipline enforcing it is a delicate matter. This is one of the challenges we take on in this report. Orderly communication bears a strong resemblance to what has been called session types in the # calculus [GH99] Leaving aside differences between the underlying calculi, orderly communication and session types are both motivated by the need to keep track of the order in which communication events take place. There are nevertheless important differences between the two, which are discussed further in ....

....channels, in [THK94] and [HVK98] Such a channel is allowed to carry a sequence of different message types over time, by contrast to a channel that is restricted to a single type of message throughout its lifetime, as in a system of simple types for the # calculus. More recently, Gay and Hole in [GH99] have developed a type system for the # calculus which combines session types, subtyping and recursive types. Whereas session channels form a distinct syntactic category in [THK94] and [HVK98] Gay and Hole enforce this distinction by means of their type system. Despite the many similarities, ....

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999.

....strongly typed programming language for mobile computation. Part of this effort is an examination of the Ambient Calculus as a foundation for such a language. The # Calculus [Mil99] has been used as a model to describe distributed computations. In particular, certain extensions of the # Calculus [GH99] have been shown adequate to describe network protocols, e.g. client server interactions. These protocols have been designed under 1 The proliferation of calculi is mostly the result of different concerns and emphases (mobility, concurrency, security, etc. brought by different researchers. At ....

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999.

....to be neglected. This suggests the following principle of behavioural semantics in linear processes. Categorise some of the typed actions as non a ecting , and abstract away non a ecting actions as if they were actions. The type structure plays a crucial role in this principle. Following [7, 11, 14, 18, 33], the linear calculus in [35] includes branching selection, which correspond to sums in the calculus and additives in Linear Logic [12] A branching is an input with I indexed branches of form x[ i2I ( y i ) P i ] while a selection is an output of form xin i ( z)Q. These constructs have the ....

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

....2 2 Linear Affine Type Discipline This section introduces the type structure for the calculus which combines linearity [49] and affinity [6] in a single framework. 2. 1 Processes Following [6, 49] we use the asynchronous version of the calculus [8, 22] with bound output [42] and branching [12, 46, 16, 21, 23]. Let x; y; and sometimes a; b; range over a countable set of names (also called channels) The set of untyped terms, which we often call processes, is given by the following grammar. P : x( y) P input j P j Q parallel j x( y) P output j ( x)P hiding j x[ i ( y i ) P i ] ....

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74--90, Springer, 1999.

....new problems not encountered before in the context of AC. The design of a type discipline enforcing it is a delicate matter. This is one of the challenges we take on in this report. Orderly communication bears a strong resemblance to what has been called session types in the calculus [GH99] Leaving aside differences between the underlying calculi, orderly communication and session types are both motivated by the need to keep track of the order in which communication events take place. There are nevertheless important differences between the two, which are discussed further in ....

....to orderly communication in AC . Before we do this, we need to briefly recall the system of simple types for the calculus; along the way we mention several extensions of simple types that have been proposed in the literature. Our presentation is a very brief adaptation of parts in [Gay99] and [GH99] 7.3.1 Simple Types and Extensions The syntax of processes P in the calculus can be given by the following grammar: P : 0 j P j j Q j x [ y] P j x [ y] P j ( x)P j P where x and y range over names, and x and y range over lists of names. This is the syntax of the plain calculus, ....

[Article contains additional citation context not shown here]

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999.

....x[ i2I ( y i ) P i ] j xin j ( y j ) Q ( y j ) P j j Q) 7) where we assume j 2 I , with I (6= denoting a nite or countably in nite indexing set. Accordingly we de ne the rule for replicated branching. Branching constructs of this kind have been studied in tyco [34] and other calculi [11, 14, 16] (the corresponding type structure already appeared in Linear Logic [1, 12] Augmenting the original asynchronous syntax with bound output and branching, we now arrive at the following grammar. P : x( y) P input j P j Q parallel j x( y) P output j ( x)P hiding j x[ i2I ( y i ) P i ] ....

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

....context of AC. The design of a type discipline enforcing them is a delicate matter, especially in the case of orderly communication. This is one of the challenges we take on in this report. Orderly communication bears a strong resemblance to what has been called session types in the calculus [GH99] Leaving aside differences between the underlying calculi, orderly communication and session types are both motivated by the need to keep track of the order in which communication events take place. There are nevertheless important differences between the two, which are discussed further in ....

....to orderly communication in AC . Before we do this, we need to briefly recall the system of simple types for the calculus; along the way we mention several extensions of simple types that have been proposed in the literature. Our presentation is a very brief adaptation of parts in [Gay99] and [GH99] 7.3.1 Simple Types and Extensions The syntax of processes P in the calculus can be given by the following grammar: P : 0 j P j jQ j x [ y] P j x [ y] P j ( x)P j P where x and y range over names, and x and y range over lists of names. This is the syntax of the plain calculus, ....

[Article contains additional citation context not shown here]

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999.

....context of AC. The design of a type discipline enforcing them is a delicate matter, especially in the case of orderly communication. This is one of the challenges we take on in this report. Orderly communication bears a strong resemblance to what has been called session types in the calculus [GH99] Leaving aside differences between the underlying calculi, orderly communication and session types are both motivated by the need to keep track of the order in which communication events take place. There are nevertheless important differences between the two, which are discussed further in ....

....channels, in [THK94] and [HVK98] Such a channel is allowed to carry a sequence of different message types over time, by contrast to a channel that is restricted to a single type of message throughout its lifetime, as in a system of simple types for the calculus. More recently, Gay and Hole in [GH99] have developed a type system for the calculus which combines session types, subtyping and recursive types. Whereas session channels form a distinct syntactic category in [THK94] and [HVK98] Gay and Hole enforce this distinction by means of their type system. Despite the many similarities, ....

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999.

.... More type constructors One beneficial point of our typing system is that it is relatively straightforward to extend our set of types with many of the standard constructs from the literature for both the l calculus and the p calculus; these include recursive types [5, 32, 26] record types [12, 31, 10], polymorphic types [7, 27] and dynamic types [2, 28] A particularly useful extension would be linear affine types, as in Assigning Types to Processes 11 the p calculus and the linear l calculus [20, 6, 16, 34] This would allow, for example, host sites to further control the access to ....

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions. ETAPS'99, LNCS, Springer, 1999.

....in the study 1 of process calculi, would o#er a semantic basis for safe information flow in communicating processes. Second, type disciplines for communicating processes are widely studied recently, especially in the context of name passing process calculi such as the # calculus, e.g. [10, 13, 20, 26, 36, 41, 40, 45]. Further, recent studies have shown that name passing calculi enjoy great descriptive power, uniformly representing diverse language constructs as name passing processes, including those of sequential and concurrent imperative, functional and object oriented languages. Since many real life ....

....they do address other security concerns, including aspects of secrecy. In the context of type disciplines for name passing processes, the full use of dualised and directed types (cf. 3) as well as their combination with causality based dynamic types, is new, though the ideas are implicit in [5, 13, 14, 19, 45]. Our construction 2 is based on graph based types in [45] incorporating the partial algebra of types from [20] the basic idea of modalities used here and in [20] originally come from linear logic [14] The syntax of the present calculus is based on [40] among others branching and recursion. ....

[Article contains additional citation context not shown here]

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74--90, Springer, 1999.

....integrate these two concerns in a practically meaningful way. 2 In the context of type disciplines for name passing processes, the full use of dualised and directed types (cf. x 3) as well as their combination with causality based dynamic types, is new, though the ideas are implicit in [16, 5, 24, 55, 15]. Our construction is based on graph based types in [55] incorporating the partial algebra of types from [25] the basic idea of modalities used here and in [25] originally come from linear logic [16] The syntax of the present calculus is based on [48] among others branching and recursion. We ....

.... is soundly embeddable into the asynchronous calculus (also called the calculus [28, 29] by concise encoding [48] The operational feasibility of branching and recursion is further studied in [35] a variant of the calculus is also used in a recent study on types for distributed software [15]) For non deterministic secrecy in general, security literature o ers many studies based on probabilistic non interference, cf. 19, 36, 51] The incorporation of probability becomes necessary because if we can observe time being spent on program phrases then unsafe information ow can occur ....

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

....cornerstone in the study 1 of process calculi, would o er a semantic basis for safe information ow in communicating processes. Second, type disciplines for communicating processes are widely studied recently, especially in the context of name passing process calculi such as the calculus, e.g. [10, 13, 20, 26, 36, 42, 41, 46]. Further, recent studies have shown that name passing calculi enjoy great descriptive power, uniformly representing diverse language constructs as name passing processes, including those of sequential and concurrent imperative, functional and object oriented languages. Since many real life ....

....they do address other security concerns, including aspects of secrecy. In the context of type disciplines for name passing processes, the full use of dualised and directed types (cf. x 3) as well as their combination with causality based dynamic types, is new, though the ideas are implicit in [5, 13, 14, 19, 46]. Our construction is based on graph based types in [46] incorporating the partial algebra of types from 2 [20] the basic idea of modalities used here and in [20] originally come from linear logic [14] The syntax of the present calculus is based on [41] among others branching and recursion. ....

[Article contains additional citation context not shown here]

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

....integrate these two concerns in a practically meaningful way. 2 In the context of type disciplines for name passing processes, the full use of dualised and directed types (cf. 3) as well as their combination with causality based dynamic types, is new, though the ideas are implicit in [16, 5, 24, 55, 15]. Our construction is based on graph based types in [55] incorporating the partial algebra of types from [25] the basic idea of modalities used here and in [25] originally come from linear logic [16] The syntax of the present calculus is based on [48] among others branching and recursion. We ....

.... is soundly embeddable into the asynchronous # calculus (also called the # calculus [28, 29] by concise encoding [48] The operational feasibility of branching and recursion is further studied in [35] a variant of the calculus is also used in a recent study on types for distributed software [15]) For non deterministic secrecy in general, security literature o#ers many studies based on probabilistic non interference, cf. 19, 36, 51] The incorporation of probability becomes necessary because if we can observe time being spent on program phrases then unsafe information flow can occur ....

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74--90, Springer, 1999.

No context found.

S. J. Gay and M. J. Hole. Types and subtypes for client-server interactions. volume 1576 of LNCS, pages 74--90. Springer-Verlag, 1999.

No context found.

S. J. Gay and M. J. Hole. Types and subtypes for client-server interactions. In S. D. Swierstra, editor, ESOP'99: Proceedings of the European Symposium on Programming Languages and Systems, volume 1576 of Lecture Notes in Computer Science, pages 74-- 90. Springer-Verlag, 1999.

....into a mainstream programmming language, or even studied theoretically in the context of a standard language paradigm: functional, imperative or objectoriented. Vallecillo et al. 13] use session types to add behavioural information to the interfaces of CORBA objects, and use Gay and Hole s [3] theory of subtyping to formalise compatibility and substitutability of components, but they have not attempted to design a complete language. In the absence of session types, current languages do little to assist the programmer in checking that a protocol has been implemented correctly. Although ....

....client sends a single message consisting of a pair of integers (Honda et al. 6] call this piggybacking ) In this case, the type of the server side would be (Int Int) Int.End and the type of the client side would again be obtained by exchanging and . The duality operator : S S [12, 6, 3, 13] is an important part of the theory of session types, but we do not need to discuss it in this paper because we only consider clients or servers in isolation. 2.2 Branching Types Now let us modify the protocol and add a negation operation to the server. The client selects one of two commands: ....

[Article contains additional citation context not shown here]

S. J. Gay and M. J. Hole. Types and subtypes for client-server interactions. In S. D. Swierstra, editor, ESOP'99: Proceedings of the European Symposium on Programming Languages and Systems, number 1576 in Lecture Notes in Computer Science, pages 74--90. Springer-Verlag, 1999.

....not simply to formalise a particular type system, but to develop a exible framework within which a variety of type systems can be investigated, with as much re use of existing theory and proof as possible. Our formalisation of the linear type system is a step towards a treatment of a language [5] based on the pi calculus and combining session types [10, 24] with subtyping [20] We should emphasise that the purpose of this formalisation is to prove properties of the type system itself, principally type soundness, rather than to support typechecking. However, given the formalisation of a ....

....number of arguments to the server, which responds by sending back the result. All communications take place on a single session channel called x; the type of the server side of this channel is S = heq : int] int] bool] end; neg : int] int] endi: The author and Malcolm Hole [5] have de ned a notion of subtyping for session types, proposing a language whose type system allows the description of backward compatible upgrades to client server systems. Ultimately we aim to formalise the type system of this language. To avoid runtime type errors, a session channel must be ....

S. J. Gay and M. J. Hole. Types and subtypes for client-server interactions. In S. D. Swierstra, editor, ESOP'99: Proceedings of the European Symposium on Programming Languages and Systems, number 1576 in Lecture Notes in Computer Science, pages 74-90. Springer-Verlag, 1999.

....not simply to formalise a particular type system, but to develop a exible framework within which a variety of type systems can be investigated, with as much re use of existing theory and proof as possible. Our formalisation of the linear type system is a step towards a treatment of a language [2] based on the pi calculus and combining session types [18, 6] with subtyping [15] Related Work The following table summarises work on formalisation of the pi calculus by a number of researchers, including the present paper. The parameters are: the theorem proving system used; the style of pi ....

....x rather than asynchronous output, choice rather than a conditional construct (and therefore drop the boolean type) and replication rather than replicated input. These di erences are fairly insigni cant as far as the type soundness proofs are concerned, but increase the similarity to the language [2] which we wish to formalise in the longer term. 3 Overview of the Formalisation We have formalised the linear type system for the pi calculus within the theorem prover Isabelle HOL [14] Isabelle is a generic theorem proving system; one of the logics which it implements is HOL, or higher order ....

[Article contains additional citation context not shown here]

S. J. Gay and M. J. Hole. Types and subtypes for client-server interactions. In S. D. Swierstra, editor, ESOP'99: Proceedings of the European Symposium on Programming Languages and Systems, number 1576 in Lecture Notes in Computer Science, pages 74-90. Springer-Verlag, 1999. 14

....Recursive types are also useful in order to describe protocols which can run through an arbitrary number of cycles, and can easily be added. 10 8 Session Types with Subtyping A natural extension to session types is that addition of subtyping, and this has been considered by Gay and Hole [4]. For non session types, subtyping is defined in the same way as in Pierce and Sangiorgi s system (Section 3) Subtyping for session types arises in two ways. When branching is not involved, the subtype relation is the pointwise extension along sequences of the Pierce and Sangiorgi subtype ....

S. J. Gay and M. J. Hole. Types and subtypes for client-server interactions. In ESOP'99: Proceedings of the European Symposium on Programming, Lecture Notes in Computer Science. Springer-Verlag, 1999.

No context found.

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999. 1

No context found.

S. Gay and M. Hole. Types and subtypes for client-server interactions. In D. Swierstra, editor, Proceedings of the 1999.

No context found.

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999.

No context found.

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74-90. Springer-Verlag, 1999.

No context found.

Simon Gay and Malcolm Hole. Types and subtypes for client-server interactions. In Proc. of ESOP'99, number 1576 in LNCS, pages 74--90. Springer-Verlag, 1999.

No context found.

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

No context found.

Simon Gay and Malcolm Hole. Types and subtypes for client-server interactions. In Doaitse Swierstra, editor, Proceedings of the 1999 European Symposium on Programming, number 1576 in Lecture Notes in Computer Science, pages 74--90, Amsterdam, The Netherlands, April 1999. Springer-Verlag.

No context found.

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

No context found.

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

No context found.

Simon Gay and Malcolm Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, volume 1576 of LNCS, pages 74--90. Springer-Verlag, 1999.

No context found.

Simon Gay and Malcolm Hole. Types and subtypes for client-server interactions. In Proc. of ESOP'99, number 1576 in LNCS, pages 74--90. Springer-Verlag, 1999.

No context found.

Simon Gay and Malcolm Hole. Types and subtypes for client-server interactions. In Proc. of ESOP'99, number 1576 in LNCS, pages 74--90. Springer, 1999.

No context found.

Simon Gay and Malcolm Hole. Types and subtypes for client-server interactions. In Proc. of ESOP'99, number 1576 in LNCS, pages 74--90. Springer-Verlag, 1999.

No context found.

Simon Gay and Malcolm Hole. Types and subtypes for client-server interactions. In Doaitse Swierstra, editor, Proceedings of the 1999 European Symposium on Programming, number 1576 in Lecture Notes in Computer Science, pages 74--90, Amsterdam, The Netherlands, April 1999. Springer-Verlag.

No context found.

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999.

No context found.

Simon Gay and Malcolm Hole. Types and subtypes for client-server interactions. In Doaitse Swierstra, editor, Proceedings of the 1999 European Symposium on Programming, number 1576 in Lecture Notes in Computer Science, pages 74--90, Amsterdam, The Netherlands, April 1999. Springer-Verlag.

No context found.

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

No context found.

Simon Gay and Malcolm Hole. Types and subtypes for client-server interactions. In Doaitse Swierstra, editor, Proceedings of the 1999 European Symposium on Programming, number 1576 in Lecture Notes in Computer Science, pages 74--90, Amsterdam, The Netherlands, April 1999. Springer-Verlag.

No context found.

S. Gay and M. Hole. Types and subtypes for client-server interactions. In Proc. European Symp. on Programming, vol. 1576 of LNCS, pp. 74--90. Springer-Verlag, 1999. 3, 26, 27, 28

No context found.

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74--90, Springer, 1999.

No context found.

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74--90, Springer, 1999.

No context found.

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74--90, Springer, 1999.

No context found.

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74--90, Springer, 1999. 12

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