dmoverton / finite-domain
Finite domain constraint solver in Haskell
☆19Updated 3 years ago
Alternatives and similar repositories for finite-domain:
Users that are interested in finite-domain are comparing it to the libraries listed below
- Where my everyday research happens☆52Updated 2 weeks ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated 7 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Zippers based on lenses and traversals☆38Updated last year
- Deep embedding of imperative programs with code generation☆23Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Kleene algebra, regular expressions☆32Updated last year
- A Haskell translation of Idris's original algebraic effects library☆41Updated 8 years ago
- Codo notation for programming with comonads in Haskell☆26Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆42Updated last month
- Agda-style equational reasoning in Haskell☆52Updated 3 months ago
- ☆14Updated 7 years ago
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 2 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 3 weeks ago
- A general purpose programming language with linear types☆44Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago