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
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago
- The Iowa Agda Library☆49Updated 2 weeks ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- IO for Gallina☆33Updated 3 months ago
- Awesome Agda Programming☆18Updated last week
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 7 months ago
- A verified compiler for a lazy functional language☆37Updated this week
- Demo for dependent types + runtime code generation☆71Updated 7 months ago
- # A simple variable binding library based on well-scoped indices and environments☆17Updated last week
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A cost-aware logical framework, embedded in Agda.☆66Updated last week
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- ☆36Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- A tutorial on how Agda infers things☆61Updated 2 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
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A pure type system implemented in OCaml☆78Updated 4 years ago