%T Higher\-Order Concurrency in Java
%A Erik D. Demaine
%E André W. P. Bakkers
%B Proceedings of WoTUG\-20: Parallel Programming and Java
%X In this paper we examine an extension to Hoare\[rs]s
Communicating Sequential Processes model called
higher\-order concurrency, proposed by Reppy. In this
extension, communication algorithms (or events) are
first\-class objects and can be created and manipulated
dynamically. In addition, threads are automatically garbage
collected and channels are first\-class, that is, they can
be passed over other channels. We describe the design of a
Java package that implements the main features of
higher\-order concurrency, with similar ease\-of\-use to
Reppy\[rs]s Concurrent ML system. Our implementation can be
easily extended to use a distributed system, which is a
major limitation with Concurrent ML. We also hope to bring
the idea of higher\-order concurrency to a wider audience,
since it is extremely powerful and flexible, but currently
only well known to the programming\-languages community.
If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.
Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org