## The Free Theorem for Ends

In Haskell, the end of a profunctor `p`

is defined as a product of all diagonal elements:

`forall c. p c c… 1,390 more words`

In Haskell, the end of a profunctor `p`

is defined as a product of all diagonal elements:

`forall c. p c c… 1,390 more words`

Have you ever seen a function call like this?

process(true, false);

We are processing something: this should be clear from the context. But what do these parameters mean? 1,117 more words

Unlike monads, which came into programming straight from category theory, applicative functors have their origins in programming. McBride and Paterson introduced applicative functors as a programming pearl in their paper… 3,069 more words

I have just read article “Please declare your variables as const” by Bartłomiej Filipek. It argues that declaring your variables `const`

is beneficial for reasons other than performance. 360 more words

aaand it’s done!

The definition language for specifying node configuration is finished – at least in principle.

It ended up being a stand-alone library called def_lang (uninspired, I know) 1,141 more words