Deconstructing Lambdas—An Awkward Guide to Programming Without Functions

• catalyst

  0 13 1.8 Haskell

  There are many category theory implementations, but this one is mine (by ChrisPenner)

  you introduce symmetric categories before monoidal categories , whereas I was thinking of introducing monoidal categories before symmetric monoidal categories.

• premonoidal

  0 3 4.4 Agda

  Agda encoding of premonoidal categories

  The reason I don't like it is the same as always: we learn nothing from that representation. I can easily think about and visualize lists. I can't do that with the equivalence classes of MonoidAST nor with this FreeMonoid implementation which just regurgitates the definition of a free monoid back at me. I prefer to put actually work into finding a useful definition, such as a list, so that I can reap the benefits later when I get to manipulate values of type list :)

• Onboard AI

  getonboard.dev

  sponsored

  Learn any GitHub repo in 59 seconds. Onboard AI learns any GitHub repo in minutes and lets you chat with it to locate functionality, understand different parts, and generate new code. Use it for free at www.getonboard.dev.

  

• categories

  0 34 0.0 Haskell

  categories from category-extras

  For example, the categories package looks like a good, standard set of typeclass definitions; but unfortunately it doesn't fit my purpose because

• free-premonoidal

  0 1 4.6 Haskell

  I haven't touched category-syntax itself in years, so it's probably very bit-rotten by now. I've been working in two other repos, premonoidal and free-premonoidal, in order to look for the elusive free {,symmetric,precartesian,cartesian} premonoidal category, and then I plan to go back and resurect category-syntax once I'm done with that quest. But if there's interest, perhaps I can try to revive it with a slightly-less-perfect representation!

Suggest a related project