The article introduces the concept of a 'monus', an algebraic structure with a partial subtraction operation, and explores its application in heap-based algorithms for tasks like sorting and graph search. It explains how monuses can be used to efficiently manage weights in heaps, particularly in the context of functional programming in Haskell. The author draws connections to prior research and demonstrates practical implementations.
Background
Monuses are algebraic structures that extend monoids with a partial subtraction operation, often used in functional programming and algorithm design. Heaps are tree-based data structures that maintain a specific ordering property, commonly applied in sorting and graph algorithms.
- Source
- Lobsters
- Published
- Mar 20, 2026 at 03:22 AM
- Score
- 6.0 / 10