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 verified compiler for a lazy functional language☆36Updated 2 weeks ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 3 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- A tutorial on how Agda infers things☆55Updated 4 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- The Iowa Agda Library☆48Updated 3 weeks ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 8 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- A deterministic parser with fused lexing☆73Updated 2 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 9 months ago
- ☆36Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 5 months ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 5 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- An implementation of Haskell’s MVars in Racket☆29Updated 9 months ago
- Rocq RFCs: documents to discuss changes to the Rocq Prover☆58Updated 5 months ago
- A cost-aware logical framework, embedded in Agda.☆63Updated this week
- ☆48Updated last month
- Command-like expressions for real infinite-precision calculations☆50Updated last month
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆48Updated 8 months ago