wenkokke / msla2014Links
wherein I implement several substructural logics in Agda
☆24Updated 6 years ago
Alternatives and similar repositories for msla2014
Users that are interested in msla2014 are comparing it to the libraries listed below
Sorting:
- Logical relations proof in Agda☆26Updated 10 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- Mtac in Agda☆28Updated 4 years ago
- ☆16Updated 3 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- ☆31Updated 10 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 8 years ago
- NbE course @ Chalmers☆28Updated 8 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- ☆19Updated 9 months ago
- Where my everyday research happens☆53Updated last month
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- what I did on my holidays☆12Updated 6 years ago
- ☆23Updated 11 months ago
- Category theory and algebra☆28Updated 8 years ago
- ☆45Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- This is the place where (more or less) stable releases of my RW library will be published.☆16Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- ☆11Updated 4 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago