Below is a Haskell implementation of binary search on lists. It takes a list of integers, a value to search for, two integers that mark the ends of the list. If the value is found t is returned, otherwise, Nothing is. I binsearchInt Int -Int-Int Maybe Int 2 binsearch xs value lo hi I hi value = binsearch xs value lo (mid-1) 1 xs ! ! mid