fcf-graphs: Type-level version of algebraic-graphs.

[ algebra, graphs, library, mit, types ] [ Propose Tags ]

Type-level version of algebraic-graphs.

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS]
Change log ChangeLog.md
Dependencies base (>=4.7 && <5), fcf-containers (>=0.6.0), first-class-families (>=0.8.0) [details]
License MIT
Copyright Daniel Firth
Author Daniel Firth
Maintainer dan.firth@homotopic.tech
Category Algebra, Graphs, Types
Source repo head: git clone https://gitlab.homotopic.tech/haskell/fcf-graphs
Uploaded by locallycompact at 2021-09-07T16:06:22Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 173 total (5 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
All reported builds failed as of 2021-09-07 [all 1 reports]

Readme for fcf-graphs-

[back to package description]


fcf-graphs mimicks algebraic-graphs but for type level computations using first-class-families.

Provided are the Graph and AdjacencyMap data types, and several functions for each. I believe this can reach api parity with algebraic-graphs. At the moment, not everything is implemented, but type-level simplify works which is interesting.

Note that ordering of underlying lists/maps is a bit weird so be careful. See the doctests for examples, and see fcf-containers for reference.