Demonstration for how to build "traverse" using GHC.Generics efficiently
☆22Oct 11, 2018Updated 7 years ago
Alternatives and similar repositories for generic-traverse
Users that are interested in generic-traverse are comparing it to the libraries listed below
Sorting:
- Deriving via☆33Aug 6, 2018Updated 7 years ago
- Authenticated Data Structures☆16Jul 5, 2015Updated 10 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated this week
- Folds for recursive types with GHC Generics☆28Aug 9, 2025Updated 6 months ago
- Measuring CPU instructions in Haskell using Linux Performance Counters☆83Jun 9, 2018Updated 7 years ago
- Deep evaluation of data structures without NFData☆10Jan 20, 2015Updated 11 years ago
- Talk on generic parallel scan☆14May 12, 2017Updated 8 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Script to download all of Hackage☆16Jul 14, 2019Updated 6 years ago
- Codo notation for programming with comonads in Haskell☆25Jan 24, 2021Updated 5 years ago
- Hopefully verifiable code generation in GHC☆94May 10, 2017Updated 8 years ago
- Haskell implementation of a nix binary cache and client.☆13Jan 4, 2018Updated 8 years ago
- Prism-based parsers and pretty printers☆17Jan 1, 2018Updated 8 years ago
- typing haskell in haskell☆18Sep 22, 2022Updated 3 years ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Delete half (minus ε) of your Haskell code!☆30Feb 13, 2026Updated 2 weeks ago
- Using Backpack to abstract over the main Haskell streaming libraries.☆34Sep 16, 2017Updated 8 years ago
- JHC Haskell compiler split into reusable components☆18Jan 10, 2026Updated last month
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- A library for doing generic programming in Agda☆36Jan 27, 2021Updated 5 years ago
- A compatibility layer for base☆21Jan 11, 2026Updated last month
- Fast ByteString Builder☆21Feb 28, 2025Updated last year
- Code for the submitted TyDe '16 extended abstract and C∘mp∘se '17 talk "`choose` Your Own Derivative"☆19May 18, 2017Updated 8 years ago
- Unpinned byte arrays in GHC haskell☆22Jan 8, 2019Updated 7 years ago
- ALGT 2.0☆30Dec 23, 2019Updated 6 years ago
- being the scrapings of my stackoverflow answers☆48Oct 23, 2019Updated 6 years ago
- Modern compiler implementation in ML, in Haskell☆16Apr 4, 2018Updated 7 years ago
- A monadic (and pretty) pretty printer for Haskell☆39Jul 12, 2023Updated 2 years ago
- Can we write a querying language with Dhall? Let's find out!☆63Oct 21, 2018Updated 7 years ago
- Symbol manipulation☆37Apr 17, 2023Updated 2 years ago
- Systematic concurrency testing meets Haskell.☆197Jan 13, 2026Updated last month
- Austin's supercompiler work☆21Nov 17, 2019Updated 6 years ago
- convert simple cryptol expressions into finite-state machines☆22Sep 15, 2017Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago