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:
- A monad for interfacing with external SAT solvers☆64Updated 2 months ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Convert Haskell source code to Coq source code.☆86Updated 2 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Fast equality saturation in Haskell☆86Updated last month
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 4 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- ☆32Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 9 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
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Haskell bindings to Microsoft's Z3 API (unofficial).☆61Updated last year
- A monadic library for symbolic evaluation☆68Updated last month
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last month
- Unification and type inference algorithms☆125Updated 10 years ago
- A language parsing quasiquoter for Haskell based heavily on ANTLR4.☆52Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- A collection of Notes on GHC☆69Updated 6 years ago
- Paper and talk☆54Updated 2 years ago
- Type Your Matrices For Great Good☆29Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago