- April 14th, 2017: given
 eitherOr, neitherNor :: Eq a => a -> a -> a -> Bool
 Is eitherOr not neitherNor?
 Prove or disprove.
- April 14th, 2017: given
 neitherNor :: Eq a => a -> a -> a -> Bool
 andNot :: Eq a => a -> a -> Bool
 How do you compose neitherNor 1 0 and andNot 4?
- April 11th, 2017:
 opts :: Credentials -> Options
 opts c = defaults & auth ?~ basicAuth (pack $ keyToken c) (pack $ secretToken c)
 point-free-itize
 given:
 data Credentials = Credentials { keyToken, secretToken :: String }
 and (?~) and (&) are from Control.Lens
 Snaps for elegance
 The above code from quillio/Twillo.hs by ismailmustafa
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.
Wednesday, May 10, 2017
April 2017 1HaskellADay 1Liners
Subscribe to:
Post Comments (Atom)
 
No comments:
Post a Comment