shnarazk / mios
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
- being the materials for Summer 2013's course☆112Updated last year
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 6 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- apkg - package manager for Agda☆37Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Convert Haskell source code to Coq source code.☆83Updated 7 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 3 months ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- HoTT in Lean 3☆78Updated 4 years ago
- A monad for interfacing with external SAT solvers☆64Updated 3 weeks ago
- Agda programming with holes☆27Updated 4 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated last month
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆56Updated 6 months ago
- Paper and talk☆53Updated last year
- ☆84Updated 7 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 4 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 7 years ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated 4 months ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago