Typed Event Structures and the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed event structures and the linear π-calculus
Theoretical Computer Science
Nominal domain theory for concurrency
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
A path-based domain theory for higher-order processes is extended to allow name generation. The original domain theory is built around the monoidal-closed category Lin consisting of path orders with join-preserving functions between their domains of path sets. Name generation is adjoined by forming the functor category [I, Lin], where I consists of finitesets of names and injections. The functor category [I, Lin] is no longer monoidal-closed w.r.t. the tensor inherited pointwisefrom Lin. However, conditions are given under which functionspaces exist. The conditions are preserved by a rich disciplineof linear types, including those of new-HOPLA, a recent powerfullanguage for higher-order processes with name generation.