Quid2 / zmLinks
Language independent, reproducible, absolute types.
☆22Updated 3 months ago
Alternatives and similar repositories for zm
Users that are interested in zm are comparing it to the libraries listed below
Sorting:
- Dependently-typed finite maps (partial dependent products)☆67Updated 3 months ago
- Use Pandoc to write simple reports within haskell code. Inspired by R-markdown.☆29Updated 5 months ago
- Composable Concurrent Computation Done Right☆30Updated 3 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated this week
- A Zoo of Haskell Newtype Wrappers☆15Updated 5 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 7 months ago
- An efficient graph library for Haskell☆40Updated 5 months ago
- Safe web routing in haskell☆30Updated 2 years ago
- Maps using values' monoidal structure during merging☆42Updated last week
- Map and Set over contiguous memory☆22Updated 2 years ago
- Classes for types where we know all the values☆39Updated last year
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated last month
- The Str signature and implementations☆21Updated 8 years ago
- ☆24Updated 5 years ago
- A GHC plugin and library for analysing GHC Core☆54Updated last year
- rewrite rules for type-level equalities☆62Updated 5 months ago
- Deriving Storable instances using GHC.Generics☆16Updated 3 years ago
- Symbol manipulation☆37Updated 2 years ago
- ☆45Updated 4 years ago
- Haskell implementation of ULIDs (Unique Lexicographically Sortable Identifiers)☆35Updated last year
- Script to download all of Hackage☆16Updated 6 years ago
- Get all your structure and rip it apart.☆32Updated 7 years ago
- Extensible type-safe unions for Haskell☆34Updated 10 months ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Kleene algebra, regular expressions☆33Updated 2 years ago
- Reification of data structures using observable sharing☆30Updated last year
- A simple interface for generating persistent data and linking its dependencies☆48Updated last month
- A monad for managed values☆51Updated 2 months ago