svenkeidel / sturdyLinks
Sturdy is a library for developing sound static analyses in Haskell.
☆61Updated 2 years ago
Alternatives and similar repositories for sturdy
Users that are interested in sturdy are comparing it to the libraries listed below
Sorting:
- Haskell bindings to Microsoft's Z3 API (unofficial).☆59Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 8 months ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Formal semantics in Agda.☆16Updated 10 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 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
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- A TACtic library for Agda☆48Updated 9 months ago
- NbE course @ Chalmers☆28Updated 9 months ago
- The Software Foundations book, in GHC☆82Updated 6 months ago
- A tutorial on how Agda infers things☆58Updated this week
- Convert Haskell source code to Coq source code.☆85Updated 2 weeks ago
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Type Your Matrices For Great Good☆29Updated 4 years ago
- ☆23Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆45Updated 3 years ago
- Paper and talk☆54Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago