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:
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- A monad for interfacing with external SAT solvers☆65Updated 6 months ago
- Convert Haskell source code to Coq source code.☆93Updated 6 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- ☆32Updated 7 years ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated last year
- Fast equality saturation in Haskell☆92Updated 3 weeks 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)☆63Updated 5 months ago
- Constructive Galois connections☆36Updated 7 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
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last year
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 9 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 8 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- 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 7 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- An enhanced unification algorithm for Coq☆58Updated last month
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 9 months ago