8:18 AM
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
7
Also any idea if there is a shorter version without the import?
The shortest version without imports that I have found is 65 bytes: Try it online!

Anonymous
@Laikoni It's very clever

8:33 AM
@Mego I can't take the full credit, because Ørjan Johansen suggested this trick a while ago, though I did derive it myself while writing this answer.

Anonymous
Well, I'm impressed, no matter who technically came up with the trick

One thing to keep in mind is that `until=<<((==)=<<)\$f` is actually a byte longer than `until(\x->x==f x)f`. So it only saves some bytes if `f` can be expressed point free without auxiliary functions.

You should totally change the room description from "For discussions about..." to "For little talks about..." ;)

Anonymous
8:49 AM
@MartinEnder I'm relatively certain John Steinbeck predates a certain Finnish band :P

Icelandic

Anonymous
Oh, I thought they were from Finland (given their song From Finner)

and "Monsters" is phonetically closer to "Monads" than "Mice" is :P
(or going by Levenshtein distance...)
wait that might not be true
hm yeah, they're both 5 by Levenshtein... well.

Anonymous
My Head is a Tacit Function

11:20 AM
@Laikoni I have the impression you use `=<<` more often than `>>=`, is there a reason?
I've actually been wondering a lot why there is fixed point built in!
I found myself using `until(f>>=(==))f` so many times.
(I actually asked this on SO a while back: stackoverflow.com/questions/38955348/… ) (Why don't you add the `until=<<((==)=<<)` solution there too? :)

3 hours later…
2:29 PM
CMS (Chat Mini Survey): What editors or IDEs do you use for Haskell?

3:18 PM
@flawr For this specific example I use this direction because `f (g x) x = (f=<<g)x` keeps the order of `f` and `g`. In general I can't think of a reason, maybe I do it unconsciously.
Though I have to admit that `((==)=<<)>>=until` also looks kind of neat, though even more unclear.

@Laikoni Would be hilarious if you could operatorify a parenthesis

As long as someone else writes the parser, sure. :D
@flawr Sublime Text and TIO.
Even though there are some annoying syntax-highlighting bugs in sublime text.

@Laikoni do you use haskell regularly outside of golfing?

3:50 PM
@flawr Emacs with haskell-mode, or TIO when golfing.

@flawr No, except sometimes as a calculator.

4 hours later…
7:36 PM
@flawr I use Vim and TIO. TIO for short programs and Vim for long ones.

So what should I use, sublime emacs or vim? :D

I don't know about you. I'm don't like most of the things people like in their IDEs, I find colors and syntax completion annoying so I try to go as vanilla as possible
I also like Vim

4 hours later…
11:24 PM
I have to admit, I'm rather proud about outgolfing Mathematica, JavaScript and Python by 85 to over 200 bytes on this challenge.

11:46 PM
@Laikoni Is there a reason you chose `((unlines.snd).).(#)` over `x&y=unlines\$snd(x#y)`

I think I had the one byte longer `x&y=(unlines.snd)\$x#y` before, so pointfree looked shorter.

Ah, also some other solutions are outputting lists of strings.