Lysxia / advent-of-coq-2021Links
☆44Updated 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:
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- The Iowa Agda Library☆49Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated 8 months ago
- A cost-aware logical framework, embedded in Agda.☆67Updated 2 weeks ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- A formalization of System Fω in Agda☆19Updated 8 months ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A tutorial on how Agda infers things☆62Updated 3 months ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 5 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- ☆36Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 6 months ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 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
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- A pure type system implemented in OCaml☆77Updated 4 years ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 months ago
- A type theory with native support for Polynomial Functors.☆39Updated 2 years ago
- IO for Gallina☆33Updated 3 months ago
- 🦠 Reusable components based on algebraic effects☆51Updated 2 months ago
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago