![]() |
CiteULike | ![]() |
keigoi's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Name Generation and Linearityby: Glynn Winskel
In LICS '05: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (2005), pp. 301-310.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractA 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.
BibTeX record
RIS record