Hi Wren,
I am maintaining Twilight STM, and it seems that it might indeed solve your
problem. We also use it for logging, locks, and other advanced STM stuff like
inconsistency repair.
If you are interested, let me know. There is a new version coming up soon, with
new features and improved imp
It's not entirely clear what you mean:
Do you want to describe grammars or parsers functionally:
In the first case, parser combinators are what you want (or some
encoding of them). There are many variations on these: LL(k),
context-free, dependent. Cyclicity (of what kind?) or empty productions
a
Hi Tom,
you can do this with Twilight STM. I recently uploaded the first version
on hackage[1].
The next version including a better algorithm and examples is about to
be released in a few days.
Twilight STM features include tagging of variables and fine-grained
conflict detection, flexible isolat
