A fornalisation of Grobner basis in ssreflect
☆12Jan 29, 2026Updated last month
Alternatives and similar repositories for grobner
Users that are interested in grobner are comparing it to the libraries listed below
Sorting:
- Verified implementation in Coq of Buchberger's algorithm for computing Gröbner bases [maintainer=@palmskog]☆11Dec 30, 2023Updated 2 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- Tactic for polynomial manipulations☆13Jan 29, 2026Updated last month
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Nov 10, 2021Updated 4 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- Stable sort algorithms and their stability proofs in Rocq☆25Dec 10, 2025Updated 2 months ago
- A formatter/linter for Coq source☆14Jan 15, 2022Updated 4 years ago
- Robots powered by Constructive Reals☆34Nov 3, 2017Updated 8 years ago
- Multinomials for the Mathematical Components library.☆16Updated this week
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- Foundational Verification of Hybrid Systems☆15Mar 23, 2017Updated 8 years ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- A proof of Abel-Ruffini theorem.☆30Oct 17, 2025Updated 4 months ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆21Apr 17, 2024Updated last year
- A Coq plugin that implements exceptions in Coq☆13Jan 7, 2021Updated 5 years ago
- ☆18May 10, 2022Updated 3 years ago
- Mathematics of Robotic Manipulation using Rocq and MathComp☆29Feb 20, 2026Updated last week
- Partial Commutative Monoids☆32Feb 18, 2026Updated last week
- Reflection library for Coq☆12Sep 26, 2019Updated 6 years ago
- Coq library for serialization to S-expressions☆20Jul 3, 2023Updated 2 years ago
- LL(1) parser generator verified in Coq☆48Jan 30, 2020Updated 6 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆37Feb 20, 2026Updated last week
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆21Mar 19, 2015Updated 10 years ago
- ☆39Feb 18, 2026Updated last week
- quotient types in cubical Agda☆24Feb 4, 2019Updated 7 years ago
- Work in progress on semi-simplicial types☆23Dec 15, 2022Updated 3 years ago
- Experiments with higher-order abstract syntax in Agda☆22Jul 14, 2022Updated 3 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 6 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆21Jan 3, 2025Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- ☆45Apr 8, 2025Updated 10 months ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Oct 22, 2023Updated 2 years ago
- Polynomial semantics of linear logic☆13Apr 15, 2018Updated 7 years ago
- The multimode presheaf proof-assistant☆37Jan 23, 2026Updated last month
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Dec 22, 2025Updated 2 months ago
- An implementation of a simple Neural network in Idris using category theory.☆24Sep 18, 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