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:
- Haskell bindings to Microsoft's Z3 API (unofficial).☆62Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Formal semantics in Agda.☆16Updated 10 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- NbE course @ Chalmers☆28Updated last year
- Where my everyday research happens☆55Updated 3 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 2 months ago
- 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
- The Evolution of a Typechecker☆54Updated 6 years ago
- Paper and talk☆55Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- ICFP tutorial☆39Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆125Updated last year
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- ☆21Updated 4 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Simple autograder for Haskell programming assignments☆17Updated 7 months ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- ☆48Updated last month
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago