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
▼
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
No comments:
Post a Comment