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:
- Formal semantics in Agda.☆16Updated 10 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆63Updated 6 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- NbE course @ Chalmers☆28Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Haskell bindings to Microsoft's Z3 API (unofficial).☆63Updated last year
- Simple autograder for Haskell programming assignments☆17Updated 11 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 5 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- Where my everyday research happens☆55Updated last week
- A TACtic library for Agda☆50Updated last year
- ☆21Updated 5 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years 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☆55Updated 6 months ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A tutorial on how Agda infers things☆63Updated 6 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- An enhanced unification algorithm for Coq☆58Updated last month
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last year