IagoAbal / haskell-z3Links
Haskell bindings to Microsoft's Z3 API (unofficial).
☆59Updated last year
Alternatives and similar repositories for haskell-z3
Users that are interested in haskell-z3 are comparing it to the libraries listed below
Sorting:
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated this week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Convert Haskell source code to Coq source code.☆85Updated 3 weeks ago
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- The Software Foundations book, in GHC☆82Updated 6 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated 11 months ago
- A TACtic library for Agda☆48Updated 10 months ago
- Benchmarks for capture-avoiding substitution☆119Updated last month
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Horn Clause Constraint Solving for Liquid Types☆150Updated last month
- 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
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated last week
- ☆84Updated 7 years ago
- A Coq library for parametric coinduction☆50Updated 5 months ago