david-christiansen / jonprl-mode
An Emac major mode for writing JonPRL code
☆8Updated 8 years ago
Alternatives and similar repositories for jonprl-mode:
Users that are interested in jonprl-mode are comparing it to the libraries listed below
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆19Updated 9 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
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 5 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 2 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆48Updated last month
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- ☆30Updated 10 years ago
- ☆11Updated 4 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Formalisation of Goedel's System T in Coq☆15Updated 13 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Formalization of Linear Logic☆10Updated 7 years ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Agda formalisation of NbE for λ□☆17Updated 7 years ago