Name generation and linearity
Glynn Winskel
- pp 301-310
Reads0
Chats0
TLDR
A path-based domain theory for higher-order processes is extended to allow name generation consisting of path orders with join-preserving functions between their domains of path sets and the functor category [I, Lin], where I consists of finite sets of names and injections.Abstract:
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 finite sets of names and injections. The functor category [I, Lin] is no longer monoidal-closed w.r.t. the tensor inherited pointwise from Lin. However, conditions are given under which function spaces exist. The conditions are preserved by a rich discipline of linear types, including those of new-HOPLA, a recent powerful language for higher-order processes with name generation.read more
Citations
More filters
Book ChapterDOI
Event structure semantics of parallel extrusion in the pi-calculus
TL;DR: It is argued that it is not possible to satisfactorily model parallel extrusion within the framework of stable event structures, so it is proposed to model a process as a pair where E is a prime event structure and X is a set of (bound) names.
Book ChapterDOI
Nominal domain theory for concurrency
David A. Turner,Glynn Winskel +1 more
TL;DR: This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory, by developing a domain theory for concurrency within FM sets.
Journal ArticleDOI
Typed event structures and the linear π-calculus
Daniele Varacca,Nobuko Yoshida +1 more
TL;DR: The semantics provided is the first event structure semantics of the @p-calculus and generalises Winskel's original event structure morphology of CCS and is theFirst typing system to control behaviour in a true concurrent model.
Journal ArticleDOI
Typed Event Structures and the π-Calculus
Daniele Varacca,Nobuko Yoshida +1 more
TL;DR: The semantics provided is the first event structure semantics of the @p-calculus and generalises Winskel's original event structure morphology of CCS and is theFirst typing system to control behaviour in a true concurrent model.
Book ChapterDOI
Compositional event structure semantics for the internal π-calculus
TL;DR: This work proposes the first compositional event structure semantics for a very expressive p-calculus, generalising Winskel's event structures for CCS.
References
More filters
Journal ArticleDOI
Linear logic
TL;DR: This column presents an intuitive overview of linear logic, some recent theoretical results, and summarizes several applications oflinear logic to computer science.
Journal ArticleDOI
Petri Nets
TL;DR: The structure of Petr i nets, thei r markings and execution, several examples of Petm net models of computer hardware and software, and research into the analysis of Pet m nets are presented, as are the use of the reachabil i ty tree and the decidability and complexity of some Petr i net problems.
Journal ArticleDOI
Petri nets, event structures and domains, part I
TL;DR: To connect the abstract ideas of events and domains of information, it is shown how casual nets induce certain kinds of domains where the information points are certain sets of events, which allows translations between the languages of net theory and domain theory.