dc.contributor.author | HENNESSY, MATTHEW | |
dc.date.accessioned | 2011-06-07T15:08:58Z | |
dc.date.available | 2011-06-07T15:08:58Z | |
dc.date.issued | 2006 | |
dc.date.submitted | 2006 | en |
dc.identifier.citation | Hym, S., Hennessy, M., Adding Recursion to Dpi. (Extended Abstract) , 2006, 115-133 | en |
dc.identifier.other | Y | |
dc.description | PUBLISHED | en |
dc.description.abstract | Dpi 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.extent | 115-133 | en |
dc.language.iso | en | en |
dc.publisher | Electronic Notes in Theoretical Computer Science | en |
dc.rights | Y | en |
dc.subject | Computer science | en |
dc.subject | dpi-calculus | en |
dc.subject | recursion | en |
dc.subject | implementation using replication | en |
dc.title | Adding Recursion to Dpi. (Extended Abstract) | en |
dc.type.supercollection | scholarly_publications | en |
dc.type.supercollection | refereed_publications | en |
dc.identifier.peoplefinderurl | http://people.tcd.ie/mcbhenne | |
dc.identifier.rssinternalid | 50346 | |
dc.identifier.rssuri | http://dx.doi.org/10.1016/j.entcs.2005.09.029 | en |
dc.identifier.uri | http://hdl.handle.net/2262/56468 | |