There was an interesting paper I read related to this topic, <i>aaaand...</i> I can't find it right now. It could have been this one: <a href="https://www.microsoft.com/en-us/research/publication/a-short-cut-to-deforestation/" rel="nofollow">https://www.microsoft.com/en-us/research/publication/a-short...</a>
Is this something that could benefit other functional programming languages like Haskell, as long as you're willing to add a SMT solver into your compiler? Or is this technique only relevant when you have complicated array slicing operations? Could a language like e.g. Julia benefit?
We have gone through a similar journey on a project at work - starting by using Z3 then moving to a simpler in-house built boolean constraint solver. Will see if it is something that could be open sourced.
no native Windows support:<p><a href="https://github.com/diku-dk/futhark/issues/1761" rel="nofollow">https://github.com/diku-dk/futhark/issues/1761</a>