- September 15th, 2016:
Given [1..n], create an infinite list of lists [[1.. n], [n+1 ... n+n], [n+n+1 ... 3n], ...]
counting :: [Integer] -> [[Integer]] - joomy @cattheory
counting = (map . (+) . fromIntegral . length) >>= iterate - September 30th, 2016: The reverse of August's one-liner:
f :: (Maybe a, b) -> Maybe (a,b)
define f. Snaps for elegance.
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.
Saturday, October 22, 2016
September 2016 1HaskellADay 1Liners Problems and Solutions
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment