Recent searches
Search options
"Oh, in #Haskell this app is just a one-liner!"
The one-liner:
`app a b c d e= runMonadT <(@)> ( (LiftValue a b c) *!* stop) . \a -> d(a) $ e`
@abuseofnotation on, so you've seen the one liner SAT solver? 
sat n = runCont $ sequence $ replicate n $ cont $ \k -> k $ k True
https://julesh.com/2016/09/22/abusing-the-continuation-monad/
Jules Hedges · Abusing the continuation monad(Recall that monads are not a good topic for your first blog post.) I intend to bootstrap a blog by writing about 2 of my old papers, Monad Transformers for Backtracking Search and The Selection Mo…
@zanzi Haha, no actually
@abuseofnotation Still more readable than most PERL code. (Am I old in that I remember coding in PERL?)
@antares The regexes were unreadable the rest of the stuff was OK, I think.
$_='while(read+STDIN,$_,2048){$a=29;$b=73;$c=142;$t=255; @T=map{$_%16or$t=$c=( $m=(11,10,116,100,11,122,20,100)[$_/16%8])&110;$t=(72,@Z=(64,72,$a=12*($_%16 -2?0:$m&17)),$b^=$_%64?12:0,@Z)[$_%8]}(16..271);if((@A=unx"C*",$_)[20]&48){$h =5;$_=unxb24,join"",@B=map{xB8,unxb8,chr($_^$a[–$h+84])}@ARGV;s/...$/1$&/;$ d=unxV,xb25,$_;$e=256|(ord$b[4])<