The functional dendritic cell algorithm: a formal specification with Haskell
The Dendritic Cell Algorithm (DCA) has been described in a number of different ways, sometimes resulting in incorrect implementations. We believe this is due to previous, imprecise attempts to describe the algorithm. The main contribution of this paper is to remove this imprecision through a new app...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2017
|
| Online Access: | https://eprints.nottingham.ac.uk/41366/ |
| _version_ | 1848796259038527488 |
|---|---|
| author | Greensmith, Julie Gale, Michael B. |
| author_facet | Greensmith, Julie Gale, Michael B. |
| author_sort | Greensmith, Julie |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | The Dendritic Cell Algorithm (DCA) has been described in a number of different ways, sometimes resulting in incorrect implementations. We believe this is due to previous, imprecise attempts to describe the algorithm. The main contribution of this paper is to remove this imprecision through a new approach inspired by purely functional programming. We use new specification to implement the deterministic DCA in Haskell - the hDCA. This functional variant will also serve to introduce the DCA to a new audience within computer science. We hope that our functional specification will help improve the quality of future DCA related research and to help others understand further its algorithmic properties. |
| first_indexed | 2025-11-14T19:45:08Z |
| format | Conference or Workshop Item |
| id | nottingham-41366 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:45:08Z |
| publishDate | 2017 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-413662020-05-04T18:49:02Z https://eprints.nottingham.ac.uk/41366/ The functional dendritic cell algorithm: a formal specification with Haskell Greensmith, Julie Gale, Michael B. The Dendritic Cell Algorithm (DCA) has been described in a number of different ways, sometimes resulting in incorrect implementations. We believe this is due to previous, imprecise attempts to describe the algorithm. The main contribution of this paper is to remove this imprecision through a new approach inspired by purely functional programming. We use new specification to implement the deterministic DCA in Haskell - the hDCA. This functional variant will also serve to introduce the DCA to a new audience within computer science. We hope that our functional specification will help improve the quality of future DCA related research and to help others understand further its algorithmic properties. 2017-06-07 Conference or Workshop Item PeerReviewed Greensmith, Julie and Gale, Michael B. (2017) The functional dendritic cell algorithm: a formal specification with Haskell. In: IEEE Congress on Evolutionary Computation 2017, 5-9 June 2017, Donostia-San Sebastian, Spain. http://ieeexplore.ieee.org/document/7969518/ |
| spellingShingle | Greensmith, Julie Gale, Michael B. The functional dendritic cell algorithm: a formal specification with Haskell |
| title | The functional dendritic cell algorithm: a formal specification with Haskell |
| title_full | The functional dendritic cell algorithm: a formal specification with Haskell |
| title_fullStr | The functional dendritic cell algorithm: a formal specification with Haskell |
| title_full_unstemmed | The functional dendritic cell algorithm: a formal specification with Haskell |
| title_short | The functional dendritic cell algorithm: a formal specification with Haskell |
| title_sort | functional dendritic cell algorithm: a formal specification with haskell |
| url | https://eprints.nottingham.ac.uk/41366/ https://eprints.nottingham.ac.uk/41366/ |