athanclark / dagLinks
A well-typed Directed Acyclic Graph in Haskell
☆14Updated 11 years ago
Alternatives and similar repositories for dag
Users that are interested in dag are comparing it to the libraries listed below
Sorting:
- Fine-grained lattice primitives for Haskell☆37Updated 6 months ago
- Simple reflection of expressions☆34Updated 4 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated 2 weeks ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated 3 months ago
- Constraint-based generics☆49Updated 3 weeks ago
- Type level lists, pairs, sums, their operations, and their properties.☆24Updated 7 years ago
- haskell memory☆48Updated 2 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Haskell implementation of ULIDs (Unique Lexicographically Sortable Identifiers)☆35Updated 11 months ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Extensible type-safe unions for Haskell☆34Updated 10 months ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago
- An experiment in functional interface design☆24Updated 9 years ago
- Type-safe time units in Haskell☆50Updated last year
- Experimental implementation of generic record subtyping☆18Updated last year
- Serializable closures for distributed programming.☆66Updated 2 years ago
- A categorical framework for circuit construction☆31Updated 9 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 weeks ago
- ☆45Updated 4 years ago
- Various type-aligned sequence data structures.☆21Updated 4 years ago
- Efficient union and equivalence testing of sets.☆31Updated 7 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆49Updated 2 weeks ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- Easy bidirectional serialization in Haskell☆49Updated 7 years ago
- A monad for managed values☆51Updated 2 months ago
- Maps using values' monoidal structure during merging☆42Updated 9 months ago
- ☆41Updated 5 years ago
- Dependently typed convolutional neural networks☆35Updated 8 years ago