I quite liked this challenge, got to learn about lexing and manually implement a parser. Feels more real-worldy than the typical numerical challenges that appear in this site.

Not a very hard Kata, though sorting requirements could be made a little clearer.

So I found out that it's possible to initiate TCP connections(with Rust at least..), and implemented an ad-hoc RPC system where the tested function sends its inputs to my server, which then solves the problem and sends back the result. Would that be considered cheating? I figured you could essentially solve challenges with any language+libraries you wish, requiring only minimal networking code to be submitted to codewars.

Interesting Kata, but I think it should be considered as a higher difficulty Kata due.

There seems to be an issue with the haskell test-cases: They assume a certain order within the Tree's elements. While running the code with my PC's stack installation I get the following error:
expected: Process 1 [Process 124 [],Process 214 [Process 219 []]]
but got: Process 1 [Process 214 [Process 219 []],Process 124 []]

Unless there's a custom Eq instance for the tree, at least.. (can't actually test this, since it doesn't compile via the server)

Secondly, Kata doesn't even compile(server times out), perhaps because I'm using Data.Tree from containers? or maybe it's just a temporary issue

Nice Kata, though I had to do quite some regex to parse all the raw data into something usable.(Or maybe I was just too lazy to type it manually)
If text parsing is not an objective of this Kata, then I think it would be better if you had provided an object array for "Action of each event upon each state".