Is Stand Reduce a Parallel Algorithm?

Stood reduce is an algorithm that can be implemented with a parallel algorithm. It works like this: If you're returning a tupl a two element tupl am, the the initial wots going to be, like, n, the minimum in value. And then how do you how do you implement your lamda so that it works? Because you're the type of your list is just an ineger and you now need to be able to go from an ineger to a Tupl a.