Re: [moca] Locality and Name matching in Pi-Calculus.

[Vasco Thudichum Vasconcelos <vv@xxxxxxxxxxx>]

On Tue, 26 Aug 2003 17:37:24 +0100 (BST)
martinb@xxxxxxxxxxxxxx wrote:

> 
> >  what are some interesting compiler optimizations
> 
> about compiler optimisations: one naive optimisation is that, assuming
> locality, you can compile any input x(v).P or !x(v).P that is a subterm
> of the program under translation and store it somewhere, until it
> becomes active: this simplifies the compiler and may make the executable
> more efficient
> (because you don't have to produce/execute code that resolves input
> subjects at run-time).

In other words, there are data-structures (better than queues) to
implement local names, since we know, at compile time, how many
receptors there will be on a given local name.  In particular,
replicated names in Pict are always local.

> martin (http://www.dcs.qmul.ac.uk/~martinb)

vasco{,ncelos}

  
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The "models for mobility" mailing list     mailto:moca@xxxxxxxxxxxxxxx
 http://www-sop.inria.fr/mimosa/personnel/Davide.Sangiorgi/moca.html