davdar / maamLinks
A monadic approach to static analysis following the methodology of AAM
☆18Updated 10 years ago
Alternatives and similar repositories for maam
Users that are interested in maam are comparing it to the libraries listed below
Sorting:
- NbE course @ Chalmers☆28Updated last year
- Where my everyday research happens☆55Updated 3 weeks ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated last week
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- A TACtic library for Agda☆51Updated last year
- Generic functions for single-sorted first-order structural unification☆45Updated 8 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- The Prettiest Printer☆35Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 6 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- A library for doing generic programming in Agda☆36Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ☆23Updated last year
- ☆16Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Implementing grep in Agda☆33Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago