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☆85Updated 9 years ago
- A monad for interfacing with external SAT solvers☆65Updated 7 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last week
- Unification and type inference algorithms☆127Updated 10 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 9 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Convert Haskell source code to Coq source code.☆93Updated 7 months ago
- Fast equality saturation in Haskell☆95Updated last week
- Horn Clause Constraint Solving for Liquid Types☆157Updated last week
- apkg - package manager for Agda☆38Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A collection of Notes on GHC☆71Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 3 weeks ago
- Constructive Galois connections☆36Updated 7 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆63Updated 6 months ago
- HoTT in Lean 3☆81Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated last year
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 6 years ago
- ☆32Updated 7 years ago
- Paper and talk☆55Updated 2 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- ☆86Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago