Changelog History
-
v0.0.1.0 Changes
March 28, 2020... 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 aDependencyM graph domain a
action instead of aNode
. Previously, that meant that you could only effectively return a value of typedomain
from your problem (through saidNode
), now it's possible to return arbitrary an arbitrary value of typea
that can be computed by accessing any number ofNode
s in the graph. You'll get the old API just by callingdependOn
on your node to construct theDependencyM
action.๐ Type inference worsened from this change, but it seems like a worthwhile improvement of the API.
-
v0.0.0.2 Changes
May 18, 2018๐จ Refactored the module structure in a way that separates
MonadDependency
andMonadDatafix
more cleanly. This entailed some breaking changes if this package wasn't used through the kitchen-sinkDatafix
module. -
v0.0.0.1
May 18, 2018