A monad for interfacing with external SAT solvers
☆65Jun 17, 2025Updated 8 months ago
Alternatives and similar repositories for ersatz
Users that are interested in ersatz are comparing it to the libraries listed below
Sorting:
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆83Jan 10, 2026Updated last month
- A natural transformation package☆16Jan 8, 2026Updated last month
- Haskell: Efficiently build a bytestring from smaller chunks☆24Jun 25, 2022Updated 3 years ago
- Tools for programming with ConstraintKinds in GHC☆74Jan 26, 2026Updated last month
- Provides Data.Void, which is in base since ghc 7.8 or so☆20Dec 8, 2025Updated 2 months ago
- A SAT solver written in Haskell.☆39Oct 7, 2018Updated 7 years ago
- Asymptotically optimal Brodal/Okasaki heaps☆34Dec 4, 2024Updated last year
- A monad, perhaps.☆32Feb 10, 2020Updated 6 years ago
- Operational-style Applicative, Alternative, Monad and MonadPlus, using free monads.☆25Jun 16, 2017Updated 8 years ago
- Haskell to D3.js binding by deep EDSL approach.☆23Sep 20, 2014Updated 11 years ago
- A Haskell library providing separation of effects on the type level, effectively splitting up the monolithic IO-monad into more limited c…☆27Mar 30, 2018Updated 7 years ago
- Operational monad library☆30Nov 30, 2021Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Jan 23, 2026Updated last month
- Authentication methods for Haskell web applications.☆34Sep 14, 2023Updated 2 years ago
- Source Layouting Engine☆11Mar 7, 2021Updated 5 years ago
- Symbolic logic expressions☆15Jul 1, 2020Updated 5 years ago
- Fast time library☆20Jul 1, 2025Updated 8 months ago
- Fast linear time sorting and discrimination for a large class of data types☆138Jun 1, 2025Updated 9 months ago
- lazy promises☆28Jan 8, 2021Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- phantom types☆39Jan 3, 2026Updated 2 months ago
- ☆17Oct 16, 2018Updated 7 years ago
- Haskell pretty printing library supporting indentation, mixfix operators, and automatic line breaks.☆14Jan 26, 2017Updated 9 years ago
- Code accompanying the paper Reflection without Remorse:Revealing a hidden sequence to speed up monadic reflection☆66Oct 4, 2021Updated 4 years ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- An MQTT protocol implementation (client and server)☆44Dec 7, 2020Updated 5 years ago
- library to manipulate git repositories in haskell (no bindings)☆50Jan 26, 2019Updated 7 years ago
- A talk on type-generic FFT in Haskell☆46Oct 24, 2021Updated 4 years ago
- ☆76Jan 11, 2026Updated last month
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Mar 26, 2017Updated 8 years ago
- Hedgehog will eat your typeclass bugs☆57Jun 3, 2025Updated 9 months ago
- Example how to link Haskell programs very quickly with lld☆48Apr 13, 2017Updated 8 years ago
- Format strings type-safely with combinators☆168Mar 5, 2024Updated 2 years ago
- Derivation of Optimized Definitions Based on Specs☆14Sep 28, 2019Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Feb 23, 2018Updated 8 years ago