lpw25 / shifted-namesLinks
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
Sorting:
- NbE course @ Chalmers☆28Updated 10 months ago
- Mtac in Agda☆28Updated 4 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 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
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Category-theoretic domain theory.☆9Updated 9 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Deferring the Details and Deriving Programs☆14Updated 5 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
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆16Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- 👹 A library for hierarchical names and lexical scoping☆26Updated 10 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month