Linearity in Process Languages

Authors:
Mikkel Nygaard;Glynn Winskel
Affiliations:
-;-
Venue:
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Year:
2002

Citing 0
Cited 7

HOPLA-A Higher-Order Process Language

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Domain theory for concurrency

Theoretical Computer Science - Logic, semantics and theory of programming
Profunctors, open maps and bisimulation

Mathematical Structures in Computer Science
Dually nondeterministic functions

ACM Transactions on Programming Languages and Systems (TOPLAS)
A universal embedding for the higher order structure of computational effects

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Preface

Theoretical Computer Science
Distributed Probabilistic and Quantum Strategies

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This connection yields an affine-linear language for processes, automatically respecting open-map bisimulation, in which a range of process operations can be expressed. An operational semantics is provided for the tensor fragment of the language. Different ways to make assemblies of processes lead to different choices of exponential, some of which respect bisimulation.