Then we compare sample programs, contrasting Linda with examples coded in Parlog86, a concurrent logic language prominently featured in a recent issue of Communications of the ACM, and with a pure functional language.
One version is written using a pure functional language (the language shown is Crystal); the other version uses C-Linda.
In a pure functional language, it appears to be impossible.
Neither of the examples discussed in the previous section can be solved in a pure functional language. The solutions in both cases depend on nondeterminism (concretely, whichever process shows up first gets access to some resource), and nondeterminism is impossible in functional languages.