Friday, October 30, 2015

October 2015 1HaskellADay Problems and Solutions

October 2015

  • October 29th, 2015: This is a perfect introduction to today's #haskell problem: dynamic predictions because cats. And today's #haskell problem has the added benefit of containing the longest epic mid-type-declaration-comment of epic epicness. Epically. ... but what you didn't see for today's #haskell problem is the preparation #fallingasleepoverthekeyboard #again And the 'S' in the anSwer is not for 'S'tatistician, but for geophf waiting for a 'S'uper heroine to give the anSwer
  • October 28th, 2015: Today's #haskell problem, we DEFINE WHAT 'AVERAGE' IS! Nope. But we do take on predictive analytics! So there's that. And here's the predictions-distributions. One day we'll even do ROC-analysis. Or not.
  • October 27th, 2015: For today's #haskell problem we say "HEY! YOU! GET YOU SOME RANDOM, YO!" and then define a random number generator A (random) solution (not really) to yesterday's random (really) #haskell problem
  • October 26th, 2015: Well, bleh! It only took all day to compose, but here's today's #haskell problem! "Learning Haskell!" Okay, that (randomly) hurt! -- one possible solution to this problem is posted at
  • October 23rd, 2015: Today's #haskell problem is thanks to Jim Webber's keynote at @GraphConnect is about triadic closure
  • October 22nd, 2015: Today's #haskell problem is thanks to Jim Webber's keynoteat the @neo4j @GraphConnect: WWI Alliances  WWI-Alliances … and as a @neo4j-graph 
  • October 16th, 2015: Today's #haskell problem asks you to create MAJYCK! with LENSES over MATRICES using SCIENCE! (lens = magic ICYMI)
  • October 15th, 2015: Today's #haskell problem is a real (silly) problem: 'efficientize' row and col definitions for Data.Matrix Zippidy Doo-Dah! Zippidy day! My, oh, my we've 'efficientized' Matrix RowCol (that scans. Kinda)
  • October 14th, 2015: For today's #haskell problem we look at multiplying matrices, because SCIENCE! Today criss-cross is gonna JUMP-JUMP! ... and sauce the apples (What this has to do with matrix-multiplication, I do not know)
  • October 13th, 2015: A rose by any other name would smell as sweet. A matrix-transpose by any other name is still today's #haskell problem Today we transpose matrices ... LIKE A GANGSTA!
  • October 12th, 2015: We go from eh-matrices to ÜBERMATRICES for today's #haskell problem And we übered those matrices at
  • October 8th, 2015: We haven't touched Data.Matrix in a while, and it didn't age well. Let's fix this for today's #haskell problem Matrices, REBORN! (or at least, prenatal, but we'll get there)
  • October 7th, 2015: So, after all that work making DList Foldable/Traversable/Monadible (eh?) TODAY's #haskell problem relaxes MultiMap That MultiMap is now hella-relaxed, yo!
  • October 6th, 2015: So YESTERDAY we looked at Foldable. @argumatronic said "Step it up: do Traversable!" So for TODAY'S #haskell problem So we WuTang Traversible CLANNEDthat solution!
  • October 5th, 2015: For today's #haskell problem we go from Monadical to Foldable, thanks to @argumatronic Wait. Is 'monadical' a word? DList. Foldable instance. Done.
  • October 2nd, 2015: For today's #haskell problem we make multimaps fast with difference lists ... OR. DO. WE! And today we find out HOW FAST MULTIMAPS ARE WITH DLISTS! (in all caps, no less)
  • October 1st, 2015: Yesterday we made Difference Lists Applicative, for today's #haskell problem we make them monadic So, difference lists are monadic now ... so there's that ...

No comments: