Show simple item record

dc.contributor.authorHENNESSY, MATTHEW
dc.date.accessioned2011-06-07T15:08:58Z
dc.date.available2011-06-07T15:08:58Z
dc.date.issued2006
dc.date.submitted2006en
dc.identifier.citationHym, S., Hennessy, M., Adding Recursion to Dpi. (Extended Abstract) , 2006, 115-133en
dc.identifier.otherY
dc.descriptionPUBLISHEDen
dc.description.abstractDpi is a distributed version of the pi-calculus, in which processes are explicitly located, and a migration construct may be used for moving between locations. We argue that adding a recursion operator to the language increases significantly its descriptive power. But typing recursive processes requires the use of potentially infinite types. We show that the capability-based typing system of Dpi can be extended to co-inductive types so that recursive processes can be successfully supported. We also show that, as in the pi-calculus, recursion can be implemented via iteration. This translation improves on the standard ones by being compositional but still requires co-inductive types and comes with a significant migration overhead in our distributed setting.en
dc.format.extent115-133en
dc.language.isoenen
dc.publisherElectronic Notes in Theoretical Computer Scienceen
dc.rightsYen
dc.subjectComputer scienceen
dc.subjectdpi-calculusen
dc.subjectrecursionen
dc.subjectimplementation using replicationen
dc.titleAdding Recursion to Dpi. (Extended Abstract)en
dc.type.supercollectionscholarly_publicationsen
dc.type.supercollectionrefereed_publicationsen
dc.identifier.peoplefinderurlhttp://people.tcd.ie/mcbhenne
dc.identifier.rssinternalid50346
dc.identifier.rssurihttp://dx.doi.org/10.1016/j.entcs.2005.09.029en
dc.identifier.urihttp://hdl.handle.net/2262/56468


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record