R. Milner. The Polyadic -calculus: a Tutorial Technical Report, ECSLFCS -91-180, 1991 Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Towards a Semantic-Based Verification Environment for the .. - Ferrari, Modoni, Quaglia (1995) (2 citations) (Correct)
....of the associations among names, and P is a process inductively defined as follows. Let N be a denumerably infinite set of names (ranged over by x, y, z, then P : 0 j :P j x(y) P j y:P j xy:P j [x = y]P j P P j P jP j (y)P The prefix y, which resembles Milner s abstraction operator [Mil91], calls for an actual instantiation of the name y. It is the only novelty w.r.t. standard calculus syntax, and it acts as a formal binder for the name y. For all the rest the notions of free and the bound names of processes are defined as usual. The operational semantics of the calculus follows ....
R. Milner. The Polyadic -calculus: a Tutorial Technical Report, ECSLFCS -91-180, 1991
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