Reification of substitutions in the asynchronous pi-calculus
| Autor: | Bernard, Noël, Dumond, Yves |
|---|---|
| Přispěvatelé: | Bernard, Noël, Laboratoire de Mathématiques (LAMA), Centre National de la Recherche Scientifique (CNRS)-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry]), Laboratoire d'Informatique, Systèmes, Traitement de l'Information et de la Connaissance (LISTIC), Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry]) |
| Jazyk: | angličtina |
| Rok vydání: | 2009 |
| Předmět: |
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO] pi-calculus TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] concurrency ACM F.3.2 process algebra explicit substitutions |
| Popis: | Submitted to publication; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|