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:
- Partial Commutative Monoids☆32Updated 5 months ago
- Certified Machine Learning☆41Updated 4 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆36Updated 3 weeks ago
- A Coq library for abstract syntactical reasoning☆24Updated 6 months ago
- ☆16Updated 4 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 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
- ☆10Updated 5 years ago
- A fornalisation of Grobner basis in ssreflect☆12Updated this week
- Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago
- Formalization of Linear Logic in Coq☆17Updated 7 months ago
- Relation algebra library for Coq☆48Updated 2 months ago
- Polynomial semantics of linear logic☆13Updated 7 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆37Updated 2 months ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Extra and extended datatypes for Lean 4☆12Updated 3 years ago
- Denotational semantics based on graph and filter models☆23Updated 11 months ago
- Dafny for Metatheory of Programming Languages☆26Updated 2 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 months ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Algebraic Combinatorics in Coq☆39Updated last month
- ☆21Updated 7 years ago
- ☆38Updated 7 months ago
- A Probability Theory Library for the Coq Theorem Prover☆54Updated 2 years ago
- Verifying encodings into propositional logic in Lean☆12Updated 2 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated this week
- A type theory with native support for Polynomial Functors.☆40Updated 2 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆53Updated last week
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago