Alternatives and similar repositories for haskell-z3:

Users that are interested in haskell-z3 are comparing it to the libraries listed below

• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆96Updated 4 months ago
• svenkeidel / sturdy
  Sturdy is a library for developing sound static analyses in Haskell.
  ☆61Updated last year
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆60Updated last year
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆53Updated 2 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆92Updated 3 weeks ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 6 months ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆124Updated 10 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• xnning / GHC-Core-Literature-Review
  Literature review of GHC's Core language, System FC
  ☆66Updated 6 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• ucsd-progsys / liquid-fixpoint
  Horn Clause Constraint Solving for Liquid Types
  ☆144Updated 2 weeks ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆81Updated 3 years ago
• plclub / lngen
  Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
  ☆30Updated 3 months ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆72Updated 2 years ago
• coq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆54Updated 5 months ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆89Updated 6 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆109Updated this week
• BillHallahan / G2
  ☆36Updated last week
• pi8027 / lambda-calculus
  A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
  ☆79Updated 4 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 3 years ago
• rocq-archive / coq-in-coq
  A formalisation of the Calculus of Constructions
  ☆66Updated 6 months ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆98Updated 2 years ago
• plclub / hs-to-coq
  Convert Haskell source code to Coq source code.
  ☆82Updated 5 months ago
• RyanGlScott / ghc-software-foundations
  The Software Foundations book, in GHC
  ☆82Updated last month
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆74Updated 3 months ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago