@flawr Fun fact: pure and <*> are the S and K combinators

Does anyone know if there is anything shorter than import Data.List;permutations

@H.PWiz not very efficient also not shorter: f x=filter((==x).sort)$mapM id(x<$x) should work if x is already sorted

I wonder whether one could define an infinite recursive list for this challenge

@flawr It also still needs import Data.List for sort.

What, sort is not in prelude?

why

@flawr Of course to make golfing more fun!

64 bytes permutions without import: p(x:r)=do e<-p r;[take n e++x:drop n e|n<-[0..length e]] \n p x=[x]

One of the rare cases where a newline cannot be replaced by ;.

Now I had to think for a long time about what \n does in haskell XD

@Laikoni are you familiar with Control.Lens? I heard it is usefull for stuff like that.

@flawr I haven't heard about it before.

@Laikoni Someone recently recommended it to me here: codereview.stackexchange.com/questions/166865/…

@flawr Nice. I also thought about submitting some Haskell code to codereview, because I usually find my self struggling when I try to write ungolfed code, but haven't found the time yet.

Just curious, is laikoni finnish?

@flawr No, if it has any meaning in Finnish this is by pure chance.

It does sound finnish at least:)

Google translate says it is Lithunian and means "the times", interesting.

just found the same:)

@flawr I haven't heard any Finnish yet, though this will change in a few weeks.

I hid a needle in a Haskell haystack: codegolf.stackexchange.com/a/145206/56433

oh heck

{-...-} are comments like /* ... */ in other languages?

Yes, currently about halve of the haystack is commented.

The syntax highlighting is working for once, unlike on some codegolf answers.

I have no idea.

I assume the comments have to be removed, otherwise it would be too easy.

@Laikoni going to finland?

Yes, but only for a few days. Helsinki, Turku and by ferry to Mariehamn.

Oh nice!