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
Sorting:
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 7 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 7 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆113Updated this week
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- The Software Foundations book, in GHC☆82Updated 4 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Convert Haskell source code to Coq source code.☆85Updated 8 months ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated this week
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 6 months ago
- A Coq library for parametric coinduction☆49Updated 3 months ago
- A TACtic library for Agda☆48Updated 8 months ago
- The Penn Locally Nameless Metatheory Library☆74Updated last month
- ☆21Updated 4 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- Where my everyday research happens☆52Updated 2 weeks ago
- ☆82Updated last year