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:
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆62Updated last year
- NbE course @ Chalmers☆28Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Where my everyday research happens☆55Updated last month
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 6 months ago
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- Formal semantics in Agda.☆16Updated 10 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 4 months ago
- A TACtic library for Agda☆50Updated last year
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Simple autograder for Haskell programming assignments☆17Updated 9 months ago
- ☆23Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆126Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- A tutorial on how Agda infers things☆63Updated 4 months ago
- Paper and talk☆55Updated 2 years ago