No abstract

No abstract

In this paper, we are interested in self-applicable partial evaluation for the pi-calculus, a language which models the concurrent behavior of comrnunicat ing processes. We use the claasic three-steps methodology.First, we write a metainterpreter for the language.Second, we introduce an abstract analysis that determines which operations ( communications) can be executed at compile-time.The notion of well-annotatedness of terms is defined. Finally, we exhibit the self-applicable partial evaluator which is applied to wellannotated terms, and we prove its correctness with respect to the interpreter. This approach is compatible with Futamura's projections. Proofs of correctness are baaed on the notion of weak reduction equivalence.

No abstract