Light Logics and Higher-Order Processes

Ugo Dal Lago
(INRIA and University of Bologna)
Simone Martini
(INRIA and University of Bologna)
Davide Sangiorgi
(INRIA and University of Bologna)

We show that the techniques for resource control that have been developed in the so-called "light logics" can be fruitfully applied also to process algebras. In particular, we present a restriction of Higher-Order pi-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.

In Sibylle Fröschle and Frank D. Valencia: Proceedings 17th International Workshop on Expressiveness in Concurrency (EXPRESS'10), Paris, France, August 30th, 2010, Electronic Proceedings in Theoretical Computer Science 41, pp. 46–60.
Published: 28th November 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.41.4 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org