Search for a command to run...
Series
A practical series on abstract algebra through the lens of C# and software design. We’ll explore how monoids, groups, rings, type classes, and generic math can turn abstract theory into useful, reusable code.
Subtype polymorphism is not the only way to make an algorithm work across types. Sometimes you cannot change the types, do not want wrapper allocations, or need behavior selected by a generic constrai
Many production problems are aggregation problems in disguise: merge partial results, combine filters, reduce collections, or compute values in parallel. Abstract algebra gives those operations precis
The same matrix algorithm can count paths, find shortest paths, or find longest paths. The data structure does not change; the algebra assigned to its operations does. That is the practical payoff of
Generic Math is easy to dismiss as a feature for numerical libraries. Its more important contribution is static abstraction: generic code can require operators, identities, parsing, and other type-lev
