Submitted to publicationIn 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
