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☆83Updated 9 years ago
- Fast equality saturation in Haskell☆90Updated last month
- ☆32Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆126Updated last year
- Convert Haskell source code to Coq source code.☆92Updated 5 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 4 months ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- The Software Foundations book, in GHC☆82Updated 11 months ago
- A monad for interfacing with external SAT solvers☆65Updated 5 months ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated last year
- Interpret Haskell programs into any cartesian closed category.☆67Updated 2 weeks ago
- Agda category theory library for denotational design☆54Updated last month
- Unification and type inference algorithms☆125Updated 10 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- ☆84Updated 8 years ago
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 6 years ago
- Horn Clause Constraint Solving for Liquid Types☆155Updated this week
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- Agda-style equational reasoning in Haskell☆54Updated 7 months ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆62Updated last year
- A library for formalizing Haskell types and functions in Coq☆170Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 9 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- A hip inductive theorem prover!☆90Updated 4 years ago
- A language parsing quasiquoter for Haskell based heavily on ANTLR4.☆52Updated 4 years ago