| Davide Sangiorgi. Lazy functions and mobile processes. Rapport de Recherche RR--2515, INRIA, Sophia Antipolis, 1995. |
....in Theorem 6. The proofs of Lemma 7 and Theorem 8 are by simultaneous induction over the depth of agents. 5 Encoding the Calculus Most process calculi with the ability of treating processes as first class objects (directly or indirectly) have attempted to embed or encode the calculus, e.g. [2, 18, 6, 13, 14, 15, 3]. The lazy calculus [1] has been modelled and analysed in the calculus by Milner [6] and Sangiorgi [13, 15] The strong lazy reduction strategy, where reduction is possible under abstraction, is more difficult to encode. The problem is that input binding in calculus can only be done by ....
.... Most process calculi with the ability of treating processes as first class objects (directly or indirectly) have attempted to embed or encode the calculus, e.g. 2, 18, 6, 13, 14, 15, 3] The lazy calculus [1] has been modelled and analysed in the calculus by Milner [6] and Sangiorgi [13, 15]. The strong lazy reduction strategy, where reduction is possible under abstraction, is more difficult to encode. The problem is that input binding in calculus can only be done by temporal guarding, u(x) P , while the calculus reduction rule allows the body of an abstraction to reduce before ....
D. Sangiorgi. Lazy functions and mobile processes. Rapport de Recherche RR-2515, INRIA SophiaAntipolis, 1995.
No context found.
Davide Sangiorgi. Lazy functions and mobile processes. Rapport de Recherche RR--2515, INRIA, Sophia Antipolis, 1995.
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