Recursion is the GOTO of functional programming - Erik Meijer¹

In our daily programming life, we encounter recursive data structures on a regular basis.

This is the third part of my progress report on a rewriting-based implementation of SubScript, FreeACP. This part covers the architecture of FreeACP I came up with so far while implementing the rewriting engine for SubScript.

This is a second part of a progress report on my attempt to model a process algebra as an expression rewriting machine. This part covers the theoretical foundations of the two implementations (engines) of SubScript: the standard one, and FreeACP, the one I am building.

This is the first part of a progress report on my attempt to model a process algebra as an expression rewriting machine. The process algebra in question is SubScript¹², which is an extension of ACP. It is recommended to familiarize yourself with ACP and process algebras before reading this article further.

In this article, I would like to analyse the architecture of Shapeless’ polymorphic functions and their inner workings.