... to accomodate set recurrences like First/Follow, while retaining the flexibility needed to compute monotone map lattices.
👀 See the changes to
solveProblem, which now takes a
DependencyM graph domain aaction instead of a
Node. Previously, that meant that you could only effectively return a value of type
domainfrom your problem (through said
Node), now it's possible to return arbitrary an arbitrary value of type
athat can be computed by accessing any number of
Nodes in the graph. You'll get the old API just by calling
dependOnon your node to construct the
👀 Type inference worsened from this change, but it seems like a worthwhile improvement of the API.
🔨 Refactored the module structure in a way that separates
MonadDatafixmore cleanly. This entailed some breaking changes if this package wasn't used through the kitchen-sink
v0.0.0.1May 18, 2018