conal/data-treify
Reify a recursive data structure into an explicit graph.
Type composition classes & instances & misc
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
Reify a recursive data structure into an explicit graph.
information operators: least upper bound (lub) and greatest lower bound (glb)
Unambiguous choice
FFTs for functor combinators