The Aardappel Programming Language – Concurrent Tree Space Transformation

Thesis does not contain any reference to Haskell.

This is an important omission because Haskell's type system allows implementation of linear logic as library [1].

[1] https://jpaykin.github.io/papers/pz_linearity_monad_2017.pdf

Most of dependence tracking can be done with Haskell's type system, as a library.