Write a curried polymorphic function, somePairWorks, that takes three arguments.
The first is a function f from 'a to boolean, the second is a function g from 'b to boolean, and the third is a list of 'a * 'b pairs, like
[(a1,b1), (a1,b2), (a3,b3)]
It should return true when there is at least one pair (x,y) on the list such that
both f x and g y are true.
11 freelancers are bidding on average $28 for this job
Hello,Client I have many experience with Java I have read your description very carefully If I can help you, I can finish it in a day Please send me the message Thanks Best regards