Lysxia / advent-of-coq-2021Links
☆43Updated 3 years ago
Alternatives and similar repositories for advent-of-coq-2021
Users that are interested in advent-of-coq-2021 are comparing it to the libraries listed below
Sorting:
- Fωμ type checker and compiler☆54Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 2 years ago
- A tutorial on how Agda infers things☆60Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- ☆36Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 4 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A Deductive Verification Tool for OCaml Programs☆75Updated 3 weeks ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A verified compiler for a lazy functional language☆37Updated 3 weeks ago
- Demo for dependent types + runtime code generation☆70Updated 6 months ago
- The Iowa Agda Library☆48Updated 2 months ago
- A deterministic parser with fused lexing☆74Updated 2 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated last week
- IO for Gallina☆33Updated last month
- A work-in-progress core language for Agda, in Agda☆55Updated 2 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated last week
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic☆38Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago