%T Communicating Haskell Processes: Composable Explicit Concurrency Using Monads
%A Neil C.C. Brown
%E Peter H. Welch, S. Stepney, F.A.C Polack, Frederick R. M. Barnes, Alistair A. McEwan, G. S. Stiles, Jan F. Broenink, Adam T. Sampson
%B Communicating Process Architectures 2008
%X Writing concurrent programs in languages that lack explicit
support for concurrency can often be awkward and difficult.
Haskell\[rs]s monads provide a way to explicitly specify
sequence and effects in a functional language, and monadic
combinators allow composition of monadic actions, for
example via parallelism and choice — two
core aspects of Communicating Sequential Processes (CSP).We
show how the use of these combinators, and being able to
express processes as first\-class types (monadic actions)
allow for easy and elegant programming of process\-oriented
concurrency in a new CSP library for Haskell: Communicating
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