lpw25 / shifted-names
Coq library for handling names
☆19Updated 2 years ago
Alternatives and similar repositories for shifted-names:
Users that are interested in shifted-names are comparing it to the libraries listed below
- NbE course @ Chalmers☆28Updated 7 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 4 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Mtac in Agda☆28Updated 4 years ago
- ☆29Updated 2 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- what I did on my holidays☆12Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 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
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- 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
- ☆11Updated 4 years ago
- ☆23Updated 10 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- ☆16Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Mechanizations of Type Theories☆28Updated 2 months 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
- ☆27Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago