Genericity and the π-calculus

Genericity and the pi-Calculus

The λ-calculus in the π-calculus

Mathematical Structures in Computer Science / Volume 21 / Issue 05 / October 2011, pp 943 996 DOI: 10.1017/S0960129511000260, Published online: 19 May 2011 Link to this article: http://journals.cambridge.org/abstract_S0960129511000260 How to cite this article: XIAOJUAN CAI and YUXI FU (2011). The λ-calculus in the π-calculus. Mathematical Structures in Computer Science, 21, pp 943-996 doi:10.10...

Sequentiality and the π-calculus

The genericity theorem and parametricity in the polymorphic A-calculus

Longo, G., K. M&ted and S. Soloviev, The genericity theorem and parametricity in the polymorphic I-calculus, Theoretical Computer Science 121 (1993) 323-349. This paper focuses on how terms of the polymorphic I-calculus, which may take types as inputs, depend on types. These terms are generally understood, in all models, to have an “essentially” constant meaning on input types. We show how the ...

Expressiveness of the π-Calculus and the $-Calculus

In this paper we investigate the expressiveness of two process algebras, the π-calculus of mobile processes and the $calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to superTuring models of computation. In particular, they are able to solve the halting problem of the Universal Turing Machine. Additionally, the $-ca...