Sijmen is looking into transforming recursively formulated data-parallel algorithms into flat data-parallelism. This is similar to detecting tail-end-recursion and transforming it into loops, but applies the well-known (map f) ° (map g) = map (f°g) equation through the recursion instead of constructing a loop.
He finished his thesis in August 2022.