chasenorman / Formalized-VotingView external linksLinks
☆13Jul 24, 2021Updated 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 Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Nov 10, 2021Updated 4 years ago
- VERified asSembler for cryptographic primitives☆12Jul 15, 2023Updated 2 years ago
- Polynomial semantics of linear logic☆13Apr 15, 2018Updated 7 years ago
- Proof-carrying code completions in Dafny☆11Apr 4, 2025Updated 10 months ago
- An efficient, lazy suffix tree implementation☆13Dec 10, 2020Updated 5 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- ☆10Feb 25, 2020Updated 5 years ago
- ☆14Apr 9, 2017Updated 8 years ago
- An abstraction on top of purescript-signal, for avoiding Channels☆15Apr 11, 2017Updated 8 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- A fornalisation of Grobner basis in ssreflect☆12Jan 29, 2026Updated 2 weeks ago
- A program logic for concurrent randomized programs☆13Nov 9, 2018Updated 7 years ago
- ☆18May 10, 2022Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Experiments in implementing functional data structures in Idris☆15Jul 25, 2019Updated 6 years ago
- Formalization of Linear Logic in Coq☆18Apr 7, 2025Updated 10 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Jan 5, 2015Updated 11 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Aug 11, 2025Updated 6 months ago
- ☆16Dec 9, 2020Updated 5 years ago
- LogiKEy Workbench: Flexible, Pluralistic Foundations for Legal and Ethical Reasoning, Metaphysics and Maths☆18Updated this week
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Nov 20, 2025Updated 2 months ago
- Functional reactive rhythm library☆22Jan 21, 2025Updated last year
- Work in progress on semi-simplicial types☆23Dec 15, 2022Updated 3 years ago
- The Squirrel Prover repository. An interactive prover for the formal verification of security protocols.☆58Oct 10, 2025Updated 4 months ago
- A Coq library for abstract syntactical reasoning☆24Apr 29, 2025Updated 9 months ago
- Purescript bindings for the Ace editor☆19Jan 9, 2023Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- being a programming language for sequential circuits☆22Dec 8, 2025Updated 2 months ago
- LL(1) parser generator verified in Coq☆48Jan 30, 2020Updated 6 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆25Nov 29, 2025Updated 2 months ago
- An implementation of a simple Neural network in Idris using category theory.☆24Sep 18, 2024Updated last year
- Ring solver for Idris☆20Nov 12, 2018Updated 7 years ago
- An abstract-interpretation based static analyzer written in Scala.☆33Mar 23, 2022Updated 3 years ago
- ☆28Jun 27, 2019Updated 6 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Dec 29, 2023Updated 2 years ago