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:
- Fast equality saturation in Haskell☆88Updated 2 weeks ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Convert Haskell source code to Coq source code.☆90Updated 4 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 6 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 3 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- A monad for interfacing with external SAT solvers☆65Updated 4 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated last year
- ☆32Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 weeks ago
- A prototypical dependently typed languages with sized types and variances☆112Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months ago
- Interpret Haskell programs into any cartesian closed category.☆66Updated this week
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆125Updated last year
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- HoTT in Lean 3☆82Updated 5 years ago