Parberry’s Pairwise Sorting Network Revealed
- Submitting institution
-
Oxford Brookes University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 185739322
- Type
- D - Journal article
- DOI
-
10.1017/S0956796818000199
- Title of journal
- Journal of Functional Programming
- Article number
- E21
- First page
- -
- Volume
- 28
- Issue
- -
- ISSN
- 0956-7968
- Open access status
- Compliant
- Month of publication
- November
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Functional pearls are polished, elegant and entertaining papers, popularised by the Journal of Functional Programming. Typical content ranges from interesting algorithms to instructive examples of program calculation or proof, which is the category of this paper. The functional presentation of Parberry’s algorithm reveals key properties and design decisions that were obscured in previous imperative expositions. The associated algebraic derivation is also much more succinct, thanks to its point-free proof style. The work led to further collaborations via research visits and an invitation to the prestigious International Federation for Information Processing (IFIP) Working Group 2.1 on Algorithmic languages and Calculi.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -