## The π-Calculus in Direct Style (1997)

Citations: | 64 - 2 self |

### BibTeX

@MISC{Boudol97theπ-calculus,

author = {Gérard Boudol},

title = {The π-Calculus in Direct Style},

year = {1997}

}

### Years of Citing Articles

### OpenURL

### Abstract

We introduce a calculus which is a direct extension of both the and the π calculi. We give a simple type system for it, that encompasses both Curry's type inference for the -calculus, and Milner's sorting for the π-calculus as particular cases of typing. We observe that the various continuation passing style transformations for -terms, written in our calculus, actually correspond to encodings already given by Milner and others for evaluation strategies of -terms into the π-calculus. Furthermore, the associated sortings correspond to well-known double negation translations on types. Finally we provide an adequate cps transform from our calculus to the π-calculus. This shows that the latter may be regarded as an "assembly language", while our calculus seems to provide a better programming notation for higher-order concurrency.