shnarazk / miosLinks
A SAT solver written in Haskell.
☆39Updated 6 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
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Convert Haskell source code to Coq source code.☆85Updated 3 weeks ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated 8 months ago
- A monad for interfacing with external SAT solvers☆64Updated last month
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- apkg - package manager for Agda☆38Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A formalization of M-types in Agda☆33Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- HoTT in Lean 3☆80Updated 4 years ago
- Fast equality saturation in Haskell☆84Updated this week
- Unification and type inference algorithms☆125Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A monadic library for symbolic evaluation☆67Updated this week
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated this week
- Agda-style equational reasoning in Haskell☆53Updated 3 months ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- Toy language to show the conversion of embedded higher-order abstract syntax (HOAS)☆21Updated 12 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Cλash/Haskell FPGA-based SKI calculus evaluator☆49Updated 9 years ago
- ☆84Updated 7 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago