pi8027 / efficient-finfunView external linksLinks
☆13Nov 23, 2019Updated 6 years ago
Alternatives and similar repositories for efficient-finfun
Users that are interested in efficient-finfun are comparing it to the libraries listed below
Sorting:
- A simple BDD library for OCaml☆13May 20, 2025Updated 8 months ago
- A fornalisation of Grobner basis in ssreflect☆12Jan 29, 2026Updated 2 weeks ago
- A Coq plugin that implements exceptions in Coq☆13Jan 7, 2021Updated 5 years ago
- Partial Commutative Monoids☆32Jun 9, 2025Updated 8 months ago
- Stable sort algorithms and their stability proofs in Rocq☆25Dec 10, 2025Updated 2 months ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Mar 29, 2023Updated 2 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Oct 9, 2023Updated 2 years ago
- ☆16Feb 18, 2025Updated 11 months ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Jan 14, 2019Updated 7 years ago
- Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components …☆18Oct 14, 2025Updated 4 months ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Oct 22, 2023Updated 2 years ago
- Formalizing convex polyhedra in Coq☆24Jul 8, 2024Updated last year
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- Multinomials for the Mathematical Components library.☆16Nov 7, 2025Updated 3 months ago
- Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]☆27Mar 28, 2025Updated 10 months ago
- Tactic for polynomial manipulations☆12Jan 29, 2026Updated 2 weeks ago
- haha I'm graduating☆14Jul 22, 2021Updated 4 years ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Nov 26, 2018Updated 7 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Mar 13, 2023Updated 2 years ago
- A coq plugin to deal with commutative diagrams☆23Jul 6, 2025Updated 7 months ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- Formal Semantics for Why3☆19Sep 28, 2025Updated 4 months ago
- Formalization of the Truly Stateless Concurrency Model Checker in Coq☆13Nov 16, 2021Updated 4 years ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆24Sep 7, 2025Updated 5 months ago
- OCaml backend for Idris2☆20Oct 12, 2020Updated 5 years ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated 3 weeks ago
- Alternative implementation of the logical framework Dedukti in Rust☆23Apr 10, 2025Updated 10 months ago
- ☆38Updated this week
- An enhanced unification algorithm for Coq☆58Jan 30, 2026Updated 2 weeks ago
- Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on☆22Feb 14, 2024Updated 2 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- αProlog☆18Jul 9, 2023Updated 2 years ago
- VERified asSembler for cryptographic primitives☆12Jul 15, 2023Updated 2 years ago