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
- Convert Haskell source code to Coq source code.☆88Updated 3 months ago
- ☆32Updated 7 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- Fast equality saturation in Haskell☆88Updated 3 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- apkg - package manager for Agda☆38Updated 4 years ago
- ☆21Updated 10 months ago
- HoTT in Lean 3☆82Updated 5 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆125Updated last year
- A monad for interfacing with external SAT solvers☆64Updated 3 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Horn Clause Constraint Solving for Liquid Types☆152Updated last month
- Lecture notes on realizability☆74Updated 7 months ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- An equational theorem prover based on Knuth-Bendix completion☆56Updated this week
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 2 months ago
- The Iowa Agda Library☆49Updated 3 weeks ago