IagoAbal / haskell-z3
Haskell bindings to Microsoft's Z3 API (unofficial).
☆58Updated last year
Alternatives and similar repositories for haskell-z3:
Users that are interested in haskell-z3 are comparing it to the libraries listed below
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- An interactive theorem prover based on lambda-tree syntax☆92Updated last month
- Unification and type inference algorithms☆125Updated 10 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- Horn Clause Constraint Solving for Liquid Types☆144Updated this week
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Total Parser Combinators in Agda☆126Updated last year
- Benchmarks for capture-avoiding substitution☆113Updated 3 weeks ago
- A Coq library for parametric coinduction☆45Updated last month
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Literature review of GHC's Core language, System FC☆66Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆80Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- ☆36Updated this week
- Convert Haskell source code to Coq source code.☆82Updated 6 months ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated 8 months ago
- Agda formalisation of second-order abstract syntax☆54Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆55Updated 5 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 4 months ago
- A TACtic library for Agda☆48Updated 5 months ago
- The Software Foundations book, in GHC☆82Updated 2 months ago
- ICFP tutorial☆39Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago