hazelgrove / agda-popl17Links
Mechanization of Hazelnut, as submitted to POPL 2017
☆16Updated 4 years ago
Alternatives and similar repositories for agda-popl17
Users that are interested in agda-popl17 are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆36Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 5 years ago
- being an experiment with potato power☆23Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Deferring the Details and Deriving Programs☆14Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- being the materials from my YOW LambdaJam 2016 talk☆11Updated 9 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- ☆16Updated 4 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Mtac in Agda☆29Updated 4 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago