Reification of substitutions in the asynchronous pi-calculus

Noël Bernard (1) , Yves Dumond (2)

1 LAMA - Laboratoire de Mathématiques
2 LISTIC - Laboratoire d'Informatique, Systèmes, Traitement de l'Information et de la Connaissance

In this paper, we bring in a dialect of the pi-calculus which involves explicit substitutions. This mechanism has the property to handle substitutions in such a way that it avoids deep parsing of the terms concerned. Then, we show that this calculus can faithfully simulate the pi-calculus, thus putting in evidence the fact that terms of the latter can be interpreted more efficiently.

Mots clés: concurrency; process algebra; pi-calculus; explicit substitutions

Domaines: Logique en informatique [cs.LO]

Noël Bernard, Yves Dumond. Reification of substitutions in the asynchronous pi-calculus. 2009. ⟨hal-00387065⟩