Haskell is particularly amenable to working with these morphisms because can be lazy and can be point-free, but that's really as far as the connection goes. This is something that you would need to build in Haskell.

It's worth saying that this paper isn't really about introducing new concepts. Instead this is about creating a new vocabulary in the form of a calculus for the construction of recursive functions.