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
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- A tutorial on how Agda infers things☆59Updated 3 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- The Iowa Agda Library☆48Updated last month
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated this week
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 4 months ago
- ☆36Updated 3 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- A deterministic parser with fused lexing☆73Updated 2 years ago
- IO for Gallina☆33Updated last month
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 5 months ago
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- A Deductive Verification Tool for OCaml Programs☆74Updated this week
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 5 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 10 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- High level commands to declare a hierarchy based on packed classes☆100Updated this week
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 10 months ago
- Specification of the Cedille Core language☆32Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 2 months ago