Skip to main content
Kent Academic Repository

Combinators for Message-Passing in Haskell

Brown, Neil C.C. (2011) Combinators for Message-Passing in Haskell. In: Practical Aspects of Declarative Languages 13th International Symposium. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 19-33. ISBN 978-3-642-18377-5. E-ISBN 978-3-642-18378-2. (doi:10.1007/978-3-642-18378-2_4) (KAR id:33879)


Much code in message-passing programs is tedious, verbose wiring code. This code is error prone and laborious - and tends to be repeated across many programs with only slight variations. By using type-classes, higher-order and monadic functions in Haskell, most of this code can be captured in re-usable high-level combinators that shorten and simplify message-passing programs. We motivate the design and use of these combinators via an example of a concurrent biological simulation, and explain their implementation in the Communicating Haskell Processes library.

Item Type: Book section
DOI/Identification number: 10.1007/978-3-642-18378-2_4
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Neil Brown
Date Deposited: 09 May 2013 15:33 UTC
Last Modified: 16 Nov 2021 10:11 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

Brown, Neil C.C..

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.