ericfinster / opetopes-in-agdaLinks
Formalization of Opetopes and Opetopic Sets in Agda
☆18Updated 8 years ago
Alternatives and similar repositories for opetopes-in-agda
Users that are interested in opetopes-in-agda are comparing it to the libraries listed below
Sorting:
- 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 9 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Category theory and algebra☆27Updated 9 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 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
- IO using sized types and copatterns☆36Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 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
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Mtac in Agda☆28Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago