twanvl / simple-reflectLinks
Simple reflection of expressions
☆34Updated 4 years ago
Alternatives and similar repositories for simple-reflect
Users that are interested in simple-reflect are comparing it to the libraries listed below
Sorting:
- Constraint-based generics☆49Updated last year
- A monad for managed values☆51Updated 2 years ago
- Various type-aligned sequence data structures.☆21Updated 4 years ago
- Map and Set over contiguous memory☆21Updated 2 years ago
- Maps using values' monoidal structure during merging☆42Updated 4 months ago
- A library for generic programming that aims to be easy to understand☆26Updated 5 months ago
- Extensible type-safe unions for Haskell☆34Updated 5 months ago
- Fast unboxed references for ST and IO monad☆15Updated 8 years ago
- Safe web routing in haskell☆30Updated 2 years ago
- Easy bidirectional serialization in Haskell☆50Updated 6 years ago
- An experiment in functional interface design☆24Updated 8 years ago
- Speculate laws about Haskell functions☆30Updated 6 months ago
- Haskell time library focusing on performance☆57Updated this week
- A HUnit/hspec assertion to verify that an expression does not typecheck☆42Updated 6 years ago
- A command-line tool for live monitoring☆25Updated 2 months ago
- Dependently typed convolutional neural networks☆35Updated 8 years ago
- Fine-grained lattice primitives for Haskell☆37Updated last month
- Generic types and functions for encoding and decoding columns☆44Updated 9 months ago
- generate contextually sensible fuzz tests for servant apps☆26Updated 9 months ago
- A GHC plugin and library for analysing GHC Core☆54Updated 6 months ago
- Derive KnownNat constraints from other KnownNat constraints☆14Updated 5 months ago
- 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
- ghc --make reimplemented with Shake☆32Updated last year
- Symbol manipulation☆36Updated 2 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- A fuzzy string set implementation in Haskell.☆10Updated last year
- Haskell implementation of ULIDs (Unique Lexicographically Sortable Identifiers)☆35Updated 6 months ago
- Code to go along with the blog post "Are Mutable References in Haskell Fast?"☆10Updated 8 years ago
- Performance shootout of various trie implementations☆18Updated 6 years ago
- A simple interface for generating persistent data and linking its dependencies☆47Updated last week