hazelgrove / agda-popl17
Mechanization of Hazelnut, as submitted to POPL 2017
☆16Updated 3 years ago
Alternatives and similar repositories for agda-popl17:
Users that are interested in agda-popl17 are comparing it to the libraries listed below
- being bits and pieces I'm inclined to leave lying around☆49Updated 4 months ago
- IO using sized types and copatterns☆33Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆16Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Session Types with Priority in Linear Haskell☆26Updated 10 months ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Category theory formalized in cubical agda☆20Updated 5 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago