In the previous three posts, we went over the process of building a DSL for arithmetic operations and we introduced the concept of Catamorphism as a way to decouple the traversal of the AST of our DSL from he operations we want to perform on it.
We saw how it could help us compose operations before traversing the AST of our DSL, leading to more efficient composition and better testability.
But Haskell being quite unique, it is quite interesting to take some distance and take time to investigate at how applicable is this concept in other languages.
In this post, we will focus on Clojure, and will:
- Build a small arithmetic DSL in Clojure
- Look at how catamorphism translates in Clojure
- Implement the same interpreters as in Haskell
- Marvel at the beauty of coding in Clojure
In the process, we will illustrate that the concept of Catamorphism is related to post-order depth first search traversal of trees.
Growing our arithmetic DSL
Our first task will be to choose a representation for our DSL.
Clojure encourages to use simple data structures as much as possible. We will follow the philosophy of the language and represent our DSL using nested vectors, and two keywords for addition and multiplication.
Using simple data structures does not forbid introducing abstractions. In the same spirit as in Haskell, we will introduce “smart constructor” (factory functions) to build our expression without having to know its internal structure:
The following code shows how to construct an arithmetic DSL from these constructors:
To complete our arithmetic expression, and abstract away from its representation, we also offer some query and extraction functions on it. In particular:
- op? returns whether the top expression is an addition or multiplication.
- rator extracts the operator of an operation (addition or multiplication)
- rands extracts the operands of an operation (addition or multiplication)
These query functions will allow us to implement the equivalent of the pattern matching logic of Haskell in our Clojure code.
Introducing Clojure Walk
We already discussed in the previous posts that catamorphisms relate to post-order depth first search traversal of the AST of our DSL. Clojure offers a really good implementation of tree traversals in its clojure.walk namespace.
Our code will rely on this namespace, as well as some additional standard namespaces inclusions. You can find them below:
In particular, clojure.walk/postwalk will be of great interest to us. It visits all nodes in tree, apply a transformation on it, before visiting their father node recursively, until it reaches the root node.
Let us see how it works by tracing the visit of all nodes along the traversal:
- The walk starts by the leftmost element and goes as deep as it possibly can
- Each node is scanned and transformed exactly once (we used the identity here)
- The father of a group of node is visited right after all its children
Note that there is one big difference with the Catamorphism we had in Haskell: because we visit every single node, we will also visit the keywords :add and :mul of our DSL. This is something we will have to take this into account.
Pretty printing walk
Let us put the postwalk function to use by translating in Clojure our most basic interpreter, the pretty printer.
- walk/postwalk plays the role of the cata function in Haskell
- The first argument of postwalk is the algebra (named for clarity only)
- The :else handles the case of the keywords :add and :mul
The code below is the full Clojure implementation:
Using the function results in the result we expect:
Except for the matching of the operation keywords, the Clojure implementation looks really much like the Haskell implementation of our previous post:
Although it leverages very different means, Clojure achieves the same kind of simple, decoupled, and close-to-specification code than Haskell. Beautiful, right?
Evaluate and dependencies
We can as easily translate to Clojure our next two most straightforward interpreters, eval (renamed evaluate since eval already exists in Clojure) and dependencies.
The evaluate function below needs an environment holding the value of the variables in the arithmetic expression. To make it simple, we used a Clojure hash map (which we can consult using the get function).
The implementation of dependencies, which lists all the variables of the expression, is also quite small and simple to follow. It makes use of Clojure standard sets to gradually accumulate all variable names from an arithmetic expression:
After the appetizers, the main dish: the implementation of the arithmetic expression optimization functions.
To show how easy composition of tree walking functions, we will provide two separate functions to optimize the addition and the multiplication:
These two functions make use of the optimize-op helper function that contains their common parts, which you can consult here.
Because our solution in Clojure did not have to include a mysterious Fix type to create an infinite type (as it was required in Haskell), composition of our “algebra” is the standard function composition:
It almost looks too simple to be true. Let us try it out to check if we are not dreaming in high definition:
Our last remaining challenge is to implement the partial evaluation of an arithmetic expression, which we will name partial-eval to avoid naming conflicts with existing Clojure functions.
To do so, we will create a replace-var function whose goal is to replace variables bound in the evaluation environment with their respective value. We can combine this function with our optimization functions to obtain a fully fledged partial application that simplifies expression in one single tree traversal.
Let us see if it works. We will partially apply our initial expression with “y” bound to zero:
Interestingly, if we partially evaluate our function with a environment holding all the variables appearing in the expression, the result is identical to a call to evaluate:
We did not have anything to do for that to be true. How amazing is this?
Conclusion and what’s next
In a few lines of code, we managed to build an arithmetic DSL, with all the interesting features we built in Haskell. The code is about the same length, as simple and composable as in Haskell.
The main difference to me is the efforts we had to put in to get the same result. There was no need to invent anything complicated, like parameterized recursion, to get to this result.
But on the other hand, we were able to count on the amazing clojure.walk namespace, and we lost almost all the type safety we had in Haskell.
As for myself, I enjoyed implementing both of these solutions equally well. I hope you enjoyed the ride too!
This concludes our study of how catamorphism translates into Clojure. The next post will be dedicated in trying to do the same exercise in C++, a much more mainstream language than our previous candidate.