Linear Forwarders

Linear forwarders are actually the basic mechanism of an earlier implementation of the pi calculus called the fusion machine. We modify the fusion machine, replacing fusions by forwarders. The result is more robust in the presence of failures, and more fundamental.

And also:

The point of this paper is to solve the problem of input capability with a language that is “just right” – it neither disallows more features than necessary (as does the join calculus), nor adds more implementation work than is necessary (as does the fusion machine).

Yes, these are the same capabilities as in capability-based security. I am looking forward to read the complete paper, as it seems to confirm my unclear ideas of how capabilities and various pi calculi are related.

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

I don't get it... anyone got

I don't get it... anyone got a version of this for those unfamiliar with the pi calculus?

Not really

anyone got a version of this for those unfamiliar with the pi calculus?
I don't think so. While the main idea seems not to be pi-specific (representing substitutions by one-use first-class thingies), the presentation, wording, theorems, etc. pretty much are.

But hey, pi is not that hard to grok (much simpler than category theory to my taste ;) ).

I believe it's well worth the effort it requires to read a couple of introduction texts - this thread looks like a reasonable starting point.