svenkeidel / sturdy
Sturdy is a library for developing sound static analyses in Haskell.
☆61Updated last year
Alternatives and similar repositories for sturdy:
Users that are interested in sturdy are comparing it to the libraries listed below
- Haskell bindings to Microsoft's Z3 API (unofficial).☆58Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- A TACtic library for Agda☆48Updated 7 months ago
- NbE course @ Chalmers☆28Updated 7 months ago
- Formal semantics in Agda.☆16Updated 9 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 5 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Constructive Galois connections☆32Updated 7 years ago
- Paper and talk☆54Updated last year
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated 3 months ago
- enumerative property-based testing for Haskell☆53Updated 3 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 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
- A Coq library for parametric coinduction☆49Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- The Software Foundations book, in GHC☆82Updated 4 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago