shnarazk / miosLinks
A SAT solver written in Haskell.
☆39Updated 7 years ago
Alternatives and similar repositories for mios
Users that are interested in mios are comparing it to the libraries listed below
Sorting:
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆127Updated last year
- Fast equality saturation in Haskell☆92Updated last week
- ☆32Updated 7 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- A monad for interfacing with external SAT solvers☆65Updated 6 months ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated last year
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last month
- apkg - package manager for Agda☆38Updated 4 years ago
- A collection of Notes on GHC☆72Updated 6 years ago
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 6 years ago
- JHC Haskell compiler split into reusable components☆57Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 5 months ago
- A formalization of category theory in cubical Agda☆59Updated 5 years ago
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆63Updated 5 months ago
- ☆22Updated 2 months ago
- Convert Haskell source code to Coq source code.☆93Updated 6 months ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- Encoding of GHC Core inside MLIR☆19Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago