svenkeidel / sturdyLinks
Sturdy is a library for developing sound static analyses in Haskell.
☆62Updated 2 years ago
Alternatives and similar repositories for sturdy
Users that are interested in sturdy are comparing it to the libraries listed below
Sorting:
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Formal semantics in Agda.☆16Updated 10 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆59Updated last year
- Simple autograder for Haskell programming assignments☆17Updated 6 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last month
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last month
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- The Software Foundations book, in GHC☆83Updated 7 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A TACtic library for Agda☆49Updated 11 months ago
- ☆21Updated 4 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆25Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Where my everyday research happens☆54Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Fine-grained lattice primitives for Haskell☆37Updated last month
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- A Really Cool Calculator written in Haskell... or is it?☆43Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 2 weeks ago
- Generic functions for single-sorted first-order structural unification☆46Updated 3 months ago