This is an interesting approach. Haskell is not a symbolic language, but you take advantage of the abstractness of type parameters in function definitions to thread your implementation of "D x" through, and pattern match on that.

It's a neat design pattern. I bet it'd work in Julia too.

I'm only a beginner in Julia and not and AD expert, but I went through the exercise of porting this to python and found it very enlightening