RedPRL / yuujinchouLinks
👹 A library for hierarchical names and lexical scoping
☆26Updated 2 months ago
Alternatives and similar repositories for yuujinchou
Users that are interested in yuujinchou are comparing it to the libraries listed below
Sorting:
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- flexible 'let rec' generation for MetaOCaml☆28Updated last week
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- my phd thesis☆26Updated last year
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Formalising session types in Coq☆17Updated 6 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 5 years ago
- Quasi-quoting library for agda☆18Updated last year
- ☆17Updated 3 years ago
- 📚 A library for managing libraries and resolving unit paths☆17Updated 2 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated this week
- Verified NbE via gluing in Agda☆11Updated last year
- Coq library for handling names☆19Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- ☆18Updated 3 years ago
- ☆11Updated 5 years ago
- Organize mathematical thoughts☆21Updated 2 years ago
- Lenses in Coq☆17Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 5 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆14Updated 8 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 3 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago