Conference item
Sorting with bialgebras and distributive laws
- Abstract:
-
Sorting algorithms are an intrinsic part of functional programming folklore as they exemplify algorithm design using folds and unfolds. This has given rise to an informal notion of duality among sorting algorithms: insertion sorts are dual to selection sorts. Using bialgebras and distributive laws, we formalise this notion within a categorical setting. We use types as a guiding force in exposing the recursive structure of bubble, insertion, selection, quick, tree, and heap sorts. Moreover, we...
Expand abstract
Actions
Authors
Bibliographic Details
- Publisher:
- ACM
- Host title:
- Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
- Publication date:
- 2012-01-01
- DOI:
- ISBN:
- 9781450315760
Item Description
- UUID:
-
uuid:fdf11970-d9d2-4528-a372-7d80d2e91304
- Local pid:
- cs:8032
- Deposit date:
- 2015-03-31
Terms of use
- Copyright date:
- 2012
If you are the owner of this record, you can report an update to it here: Report update to this record