I went today to a Joe Bonamassa concert in Paris.

Adjoint folds are easy when you use double categories.

Angella Collier is spot on. youtu.be/wBBnfu8N_J0?si…

Working on some adjoint anamorphisms.

Sam Bankman-Fried has just been sentenced to 25 years in prison

remember when some supposedly very smart people were so sure he wasn't even going to be investigated

For completeness, a blog post with the categorical view of the pre-lens construction. bartoszmilewski.com/2024/03/24/neu…

New blog post on using lenses and profunctors to implement a neural network. bartoszmilewski.com/2024/03/22/neu…

Interested in learning Haskell? The full set of 16 videos from my introductory course based on the book 'Programming in Haskell' is now freely available on YouTube. Happy Haskelling :-) tinyurl.com/haskell-notts

RIP en.wikipedia.org/wiki/Frans_de_…

(Everyone surely recognizes this emotion: youtube.com/watch?v=meiU6T…)

In imperative languages people tend to access data in containers one by one, using loops. So bound-checks in accessors kill performance. The solution is to implement optimized bulk operations: maps/catamorphisms; and discourage loops by making all single accessors bound-checked.

I used to laugh at the naivety of sci-fi stories in which future societies are ruled by dictators and engaged in devastating wars. Surely, humanity would have outgrown such follies.

...I'm not laughing any more.

Funny thing is that many C++ interview questions ask you to implement things like tree traversals without using recursion. Instead of the call stack, you use a much less efficient hand-crafted stack. All because of ancient processor architectures. stackoverflow.com/questions/5987…

Stack overflow error is an abomination and should only happen when you exhaust your computer's memory. It's like saying that your loop cannot iterate more than 1000 times. So much needless work goes towards eliminating recursion for the fear of stack overflow.