dmoverton / finite-domainLinks
Finite domain constraint solver in Haskell
☆20Updated 4 years ago
Alternatives and similar repositories for finite-domain
Users that are interested in finite-domain are comparing it to the libraries listed below
Sorting:
- A general purpose programming language with linear types☆43Updated 8 years ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated last year
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 months ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Dependently typed elimination functions using singletons☆28Updated 11 months ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Where my everyday research happens☆55Updated last month
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Category theory and algebra☆26Updated 9 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 8 months ago
- Provides a type-safe way of working with permutations in Idris☆37Updated 4 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- ICFP tutorial☆39Updated 4 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆32Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago