Dependent pair recursion under lambda
I’m trying to write code where I transform a curried representation of a function to a function taking a Vect
argument. With the function structures I’ve tried, I got stuck, because I’d need to know the Vect
length or the head of the Vect
before the point where I got it available. Which recursion structure can I use to make freeToVectReader
compile? With my current code I get