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

[martinb@xxxxxxxxxxxxxx]

>  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).

martin (http://www.dcs.qmul.ac.uk/~martinb)
  
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The "models for mobility" mailing list     mailto:moca@xxxxxxxxxxxxxxx
 http://www-sop.inria.fr/mimosa/personnel/Davide.Sangiorgi/moca.html