IagoAbal / haskell-z3
Haskell bindings to Microsoft's Z3 API (unofficial).
☆57Updated 6 months ago
Related projects: ⓘ
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated last year
- Sturdy is a library for developing sound static analyses in Haskell.☆60Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆55Updated 5 months ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆121Updated last month
- Agda bindings to SMT-LIB2 compatible solvers.☆94Updated 5 months ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- A TACtic library for Agda☆48Updated this week
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆68Updated 5 years ago
- A Coq library for parametric coinduction☆43Updated last year
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 5 months ago
- A tutorial on how Agda infers things☆33Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆71Updated 2 months ago
- An interactive theorem prover based on lambda-tree syntax☆89Updated 3 weeks ago
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- ☆21Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆77Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆50Updated this week
- They see me rollin'. They're Heyting. Patrollin' and tryna catch me ridin' dirty. -- Chamillionaire, 2005☆82Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆80Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- SPLV20 course notes☆106Updated last year
- Agda programming with holes☆26Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆77Updated 8 years ago
- Benchmarks for capture-avoiding substitution☆106Updated last year
- Convert Haskell source code to Coq source code.☆77Updated 3 weeks ago