svenkeidel / sturdy
Sturdy is a library for developing sound static analyses in Haskell.
☆60Updated last year
Related projects ⓘ
Alternatives and complementary repositories for sturdy
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆57Updated 8 months ago
- A tutorial on how Agda infers things☆36Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆71Updated last week
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last year
- Constructive Galois connections☆32Updated 6 years ago
- A TACtic library for Agda☆48Updated 2 months ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated 2 months ago
- NbE course @ Chalmers☆28Updated last month
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- 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
- Where my everyday research happens☆53Updated last week
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 3 months ago
- An enhanced unification algorithm for Coq☆49Updated 5 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- ICFP tutorial☆40Updated 3 years ago
- The Software Foundations book, in GHC☆83Updated 3 weeks ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- ☆47Updated last month
- Convert Haskell source code to Coq source code.☆78Updated 2 months ago
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Type Your Matrices For Great Good☆29Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆41Updated this week