Of Monads and Men

I wrote an explanation of why until=<<((==)=<<) is a fix point function, which might be of interest for new Haskell learners: codegolf.stackexchange.com/a/144402/56433

"Of Monads and Men"

Fun fact: I'm reading Maus for school. At one point, the narrator refers to a character named Haskel as a kombinator.

looks like no one is here....

@flawr The Curry-Howard correspondence associates types with logical statements and terms with proofs. For example, the type (.) :: (b -> c) -> (a -> b) -> (a -> c) corresponds to the logical statement ∀A,B,C. (B → C) → ((A → B) → (A → C)).

PSA: Literate Haskell was added to TIO: tio.run/#haskell-literate

@Nitrodon I recommend reading wiki.haskell.org/Typeclassopedia

@Mego Have you read Parallel and Concurrent Programming in Haskell?

[a] is Foldable t => t for noobs :P

Similarly, (dec -> f) = ... in Haskell is equivalent to f = dec (...).

For example (flip -> f) = \x y -> x - y

I just looked up some things in Mathematica and found this list of operators: mathematica.stackexchange.com/a/25616/35894

@BMO hehe, nice wine you have down here

@ØrjanJohansen which is why you're using Haskell in the first place

PSA: If some of you missed it code-golf.io also allows Haskell submissions. I feel like the Haskell golfers should be more present and I could certainly do with some more competition ;P

mine

Actually, you can save one more by making sure the declaration is last in the file.

@CatWizard 21 bytes in spirit of your sandbox challenge.

Also, didn't realise f<$>g<*>h could be just f.g<*>h. Thanks!

As I said, this would be a quite complex project requiring someone crazy enough to try it, but we're on a site full of people who enjoy writing unreadable, inefficient codes for useless problems for fun, so craziness is not missing :D

nice read on abstractions (lengthy) cdsmith.wordpress.com/2012/04/18/why-do-monads-matter