A Logic for Distributed Higher Order π-Calculus

2008 ◽  
pp. 351-363
Author(s):  
Zining Cao
Keyword(s):  
Higher Order ◽  
Π Calculus

scholarly journals Light logics and higher-order processes

2014 ◽  
Vol 26 (6) ◽  
pp. 969-992 ◽  
Author(s):  
UGO DAL LAGO ◽  
SIMONE MARTINI ◽  
DAVIDE SANGIORGI
Keyword(s):  
Polynomial Time ◽  
Linear Logic ◽  
Higher Order ◽  
Resource Control ◽  
Process Algebras ◽  
Π Calculus ◽  
Soft Processes

We show that the techniques for resource control that have been developed by the so-calledlight logicscan be fruitfully applied also to process algebras. In particular, we present a restriction of higher-order π-calculus inspired by soft linear logic. We prove that any soft process terminates in polynomial time. We argue that the class of soft processes may be naturally enlarged so that interesting processes are expressible, still maintaining the polynomial bound on executions.

scholarly journals Reversibility in the higher-order π-calculus

2016 ◽  
Vol 625 ◽  
pp. 25-84 ◽  
Author(s):  
Ivan Lanese ◽  
Claudio Antares Mezzina ◽  
Jean-Bernard Stefani
Keyword(s):  
Higher Order ◽  
Π Calculus

From λ to π; or, Rediscovering continuations

1999 ◽  
Vol 9 (4) ◽  
pp. 367-401 ◽  
Author(s):  
DAVIDE SANGIORGI
Keyword(s):  
Higher Order ◽  
Π Calculus ◽  
The Relationship

We study the relationship between the encodings of the λ-calculus into π-calculus, the Continuation Passing Style (CPS) transforms, and the compilation of the Higher-Order π-calculus (HOπ) into π-calculus. We factorise the π-calculus encodings of (untyped as well as simply-typed) call-by-name and call-by-value λ-calculus into three steps: a CPS transform, the inclusion of CPS terms into HOπ and the compilation from HOπ to π-calculus. The factorisations are used both to derive the encodings and to prove their correctness.

Sign in / Sign up

Export Citation Format

Share Document