chasenorman / Formalized-VotingLinks
☆13Updated 4 years ago
Alternatives and similar repositories for Formalized-Voting
Users that are interested in Formalized-Voting are comparing it to the libraries listed below
Sorting:
- A fornalisation of Grobner basis in ssreflect☆12Updated 2 months ago
- ☆10Updated 5 years ago
- ☆16Updated 4 years ago
- ☆21Updated 7 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 3 years ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆38Updated this week
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- Partial Commutative Monoids☆29Updated 3 months ago
- Type theory in type theory☆16Updated 13 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- ☆47Updated 2 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆35Updated last week
- A type theory with native support for Polynomial Functors.☆39Updated last year
- Coq library for serialization to S-expressions☆19Updated 2 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A Probability Theory Library for the Coq Theorem Prover☆54Updated last year
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months 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 Coq library for abstract syntactical reasoning☆24Updated 4 months ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Polynomial semantics of linear logic☆13Updated 7 years ago
- Extra and extended datatypes for Lean 4☆11Updated 2 years ago
- ☆18Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated 2 months ago
- ☆17Updated 6 years ago