- July 26th, 2017: We look at unifying fresh variables to ground terms for today's #haskell problem. And we have unification working for free variables and ground terms for today's #haskell solution.
- July 25th, 2017: We look at the beginnings of unification with ground terms for today's #haskell problem. Today's #haskell solution shows unification of ground terms in a monadic domain.
- July 24th, 2017: Commuters today occupy my mind for today's #haskell problem. A little reasoning, a little harsh reality, and we have today's #haskell solution.
- July 20th, 2017: I didn't go for my morning jog, so today's #haskell problem looks at running ... expressions. Eheh. For today's #haskell solution, some people run on empty, but I run on LOGIC! ... same thing.
- July 19th, 2017: Today's #haskell problem is our first step in our scheme to reasoning! MWA-HAHA! via the Reasoned Schemer. Today's #haskell solution:some days are #s; some days are #u
- July 7th, 2017: It's FRIDAY, and you know what that means? SCRABBLE DAY! for today's #haskell problem
- July 6th, 2017: For today's #haskell problem we invert a matrix to solve a system of equations.
- July 5th, 2017: For today's #haskell problem we have a * b = c ... HOW HARD CAN THAT BE? #famouslastwords The #haskell solution took like a whole second! THAT WAS HARD!
- July 4th, 2017: Boys and girls! Gather 'round as I spin you a story of Jemima and Roland for today's #haskell problem.
- July 3rd, 2017: Today's #haskell problem is all 'bout the Ord, 'bout the Ord, 'bout the Ord. No Functor. Today's #haskell solution uses a little sorting logic (not sordid logic; that's different) to show Jim is the eldest.
Incorporates strong typing over predicate logic programming, and, conversely, incorporates predicate logic programming into strongly typed functional languages. The style of predicate logic is from Prolog; the strongly typed functional language is Haskell.
Monday, July 31, 2017
July 2017 1HaskellADay Problems and Solutions
Friday, July 7, 2017
June 2017 1HaskellADay 1Liners
- June 17th, 2017:
f :: (a, [a]) -> [a] -> [a]
f (c, w1) w2 = c:w1 ++ w2
Define f points-free - bazzargh @bazzargh (++).uncurry(:)
- Felt there must be a nicer way to exploit symmetry of mappend.uncurry(mappend.pure) but can't find it
Monday, July 3, 2017
June 2017 1HaskellADay Problems and Solutions
- June 21st, 2017: Today's #haskell problem connects to and queries a SQL database of your choosing.
- June 16th, 2017: Today's #haskell problem has us interacting with the OS environment in anticipation of SQL database queries. Today's #haskell solution uses Applicative Functors to string together values we collect from the OS environment.
- June 15th, 2017: Today's Haskell problem comes by way of @aisamanra, Mr. Lists-are-Mu-functions-in-the-function-of-Mus. Today's #haskell solution shows Lists are Mu-functors! ... now, making them instances of type-classes, however ...
- June 14th, 2017: Today's #haskell problem is brought by way of @matthieubulte: approximating solutions with Runge-Kutta. The #haskell solution shows I can (ψ, ε, k) with the best of them! AHA! ... but is it the CORRECT solution? 🙄
- June 6th, 2017: In today's #haskell problem, we go clockwise around a binary tree, because ... we've had one too many?
Subscribe to:
Posts (Atom)