Pinned Loading

1. zero-monad-where-all-computations-are-the-same zero-monad-where-all-computations-are-the-same Public template

   In a theoretical sense, this code describes a monadic group for producing a singleton or a single point, which is a compressible space or set because it can be continuously deformed to zero. It is …

   Haskell

2. implementation-local-mutable-state-using-effect-handlers-in-haskell implementation-local-mutable-state-using-effect-handlers-in-haskell Public

   Using the free monad style. Implementation local mutable state using effect handlers in Haskell.

   Haskell

3. empty-list-or-non-empty-list-as-recursive-multipointed-structure empty-list-or-non-empty-list-as-recursive-multipointed-structure Public

   This simple example of how the “reverse” algorithm works can inspire students and motivate them to study category theory more actively. Since the concepts of this theory are too complex for many st…

   Haskell

4. empty-list-or-non-empty-list-as-a-structure-for-identity-monad empty-list-or-non-empty-list-as-a-structure-for-identity-monad Public

   This simple example of brilliantly working pattern matching can inspire students and motivate them to engage more actively with category theory. Since the concepts of this theory are too complex fo…

   Haskell

5. soutient.github.io soutient.github.io Public

   Continuous learning as growth mindset rather than just existing knowledge.