Tag
A concise implementation of a hash map in 25 lines of C using FNV-1a hashing and bitwise AND for efficient modulo operation, with void pointers for type-generic storage.
The article explains the conceptual shift required when moving from imperative to declarative programming, using Prolog to illustrate thinking in terms of relations rather than mutable state.
This blog post provides a toy Haskell implementation of profunctor equipment, including natural transformations and composition, to make category-theoretic concepts accessible to programmers.