Communicating Haskell Processes: Composable Explicit Concurrency Using Monads

Brown, Neil (2008) Communicating Haskell Processes: Composable Explicit Concurrency Using Monads. In: Communicating Process Architectures 2008. (Full text available)

PDF
Download (164kB)
[img]
Preview

Abstract

Writing concurrent programs in languages that lack explicit support for concurrency can often be awkward and difficult. Haskell'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 Haskell Processes.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: haskell concurrency chp
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Neil Brown
Date Deposited: 29 Mar 2010 12:14
Last Modified: 17 Apr 2014 14:31
Resource URI: http://kar.kent.ac.uk/id/eprint/24103 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year