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.
Pages
▼
Tuesday, September 19, 2017
August 2017 1HaskellADay 1Liners Problems and Solutions
August 1st, 2017:
f :: (Maybe a, b) -> Maybe (a, b) Define points-free.
August 1st, 2017: Given f above and f a and f b are mutually exclusive in Maybe monad, define g :: Maybe (a, b) -> Maybe (a, b) -> (Maybe a, b) points free
August 1st, 2017: Now, let's define the dual of f f' :: Maybe (a, b) -> (Maybe a, b) points free
No comments:
Post a Comment