The topos theory of computing: introduction to the mathematics of dataflow [pdf](raw.githubusercontent.com) |
The topos theory of computing: introduction to the mathematics of dataflow [pdf](raw.githubusercontent.com) |
My work in this field has led me to search for new mathematical foundations for dataflow analysis. These foundations will abstract the concept and address a number of issues. Firstly, traditional dataflow analysis only works on explicitly defined product types like bit vectors. This provides a limited scope for the theory. To generalize from this, we can use partitions, which can model any type of information accessible by a function.
Then to model dataflow relations in this new abstracted setting, I have suggested the use of the Sierpinski topos. Using this fundamental topos, we can model dataflow relations between information locations represented with the highest level of generality. This forms a broad generalisation of the notion of congruences from abstract algebra.
So basically, all I am doing is updating that prior work and turning it into a Topos Structure Theory of Sequential Machines. I arrived at the concept of partition pairs independently through the Sierpinski topos. Hartmans & Stearns came up with the same idea for its engineering applications. It often happens that when an idea is good, it tends to crop up independently in multiple different places.