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:
- NbE course @ Chalmers☆28Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 6 months ago
- Where my everyday research happens☆56Updated last week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Formal semantics in Agda.☆16Updated 10 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆63Updated last year
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆64Updated 6 months ago
- A TACtic library for Agda☆51Updated last year
- Paper and talk☆55Updated 2 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 9 months ago
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated 3 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆36Updated 7 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago