We present PolySing#, a calculus that models process interaction based on copyless message passing, in the style of Singularity OS. We equip the calculus with a type system that accommodates polymorphic endpoint types, which are a variant of polymorphic session types, and we show that well-typed processes are free from faults, leaks, and communication errors. The type system is essentially linear, although linearity alone may leave room for scenarios where well-typed processes leak memory. We identify a condition on endpoint types that prevents these leaks from occurring.

BibTeX code

@inproceedings{BonoPadovani11,
volume = {59},
author = {Viviana Bono and Luca Padovani},
series = {EPTCS},
booktitle = {Proceedings of the Interaction and Concurrency Experience
(ICE'11)},
url = {http://www.di.unito.it/~padovani/Papers/BonoPadovani11.pdf},
abstract = { We present PolySing#, a calculus that models process interaction
based on copyless message passing, in the style of Singularity OS.
We equip the calculus with a type system that accommodates
polymorphic endpoint types, which are a variant of polymorphic
session types, and we show that well-typed processes are free from
faults, leaks, and communication errors. The type system is
essentially linear, although linearity alone may leave room for
scenarios where well-typed processes leak memory. We identify a
condition on endpoint types that prevents these leaks from
occurring. },
title = {{Polymorphic Endpoint Types for Copyless Message Passing}},
publisher = {Open Publishing Association},
year = {2011},
pages = {52-67},
doi = {10.4204/EPTCS.59.5},
}