A pedestrian implementation of directed acyclic graphs
Why do you think that https://github.com/higherkindness/mu-haskell is a good alternative to pedestrian-dag
A pedestrian implementation of directed acyclic graphs
Why do you think that https://github.com/higherkindness/mu-haskell is a good alternative to pedestrian-dag