| Vasconcelos, V. T., Predicative polymorphism in pi-calculus, in: Parallel Architectures and Languages Europe, 1994, pp. 425--437. |
....paradigm look more complex than those in traditional functional programming, and we paid attention to the session of processes as abstraction in those interaction. In this context, several proposals for typed abstraction of the communication between processes, have been recently done, including [21, 24, 3, 19, 23, 26, 9, 27]. 21, 24] propose concurrency and interaction primitives and associated type notions to be incorporated into ML like functional programming languages[18] In another approach [22] a programming language and a typing system as an extension of (polyadic) calculus is proposed. This approach ....
....crucial for flexible programming based on interaction. 6.2 Future Work While we have not presented a typing algorithm in this paper, it is easy to formulate a typing algorithm corresponding to our typing system. 25] gives an example of such an algorithm in the way similar to what are given in [28, 27], using the notion of kinding as presented in [20] In [25] the kinding is also used to gain the principal types for processes in the typing system. As discussed already, various typing notions have been studied for extensions of ML and name passing process calculi [3, 9, 19, 21, 23, 24, 26] ....
V. T. Vasconcelos. Predicative Polymorphism in Pi-Calculus. In PARLE'94, LNCS, 1994.
No context found.
Vasconcelos, V. T., Predicative polymorphism in pi-calculus, in: Parallel Architectures and Languages Europe, 1994, pp. 425--437.
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