Combinators for Message-Passing in Haskell

Brown, Neil C.C. (2011) Combinators for Message-Passing in Haskell. In: Practical Aspects of Declarative Languages. Lecture Notes in Computer Science, 6359. Springer pp. 19-33. ISBN 978-3-642-18377-5. (doi:https://doi.org/10.1007/978-3-642-18378-2_4) (Full text available)

PDF - Author's Accepted Manuscript
Download (245kB) Preview
[img]
Preview
Official URL
http://dx.doi.org/10.1007/978-3-642-18378-2_4

Abstract

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: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Neil Brown
Date Deposited: 09 May 2013 15:33 UTC
Last Modified: 30 Apr 2014 09:03 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/33879 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year