thery / grobnerLinks
A fornalisation of Grobner basis in ssreflect
☆12Updated 2 months ago
Alternatives and similar repositories for grobner
Users that are interested in grobner are comparing it to the libraries listed below
Sorting:
- ☆13Updated 5 years ago
- A Coq tactic for proving multivariate inequalities using SDP solvers☆10Updated 2 weeks ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆33Updated last year
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 3 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 5 months ago
- Tactic for polynomial manipulations☆12Updated 4 months ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆34Updated this week
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- Lenses in Coq☆17Updated 2 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- ☆16Updated 3 months ago
- Experiments with Realizability in Univalent Type Theory☆19Updated 11 months ago
- Relation algebra library for Coq☆49Updated 2 weeks ago
- a version of the 2048 game for Coq☆22Updated last year
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆25Updated last week
- Implementation of sprintf for Coq☆18Updated 5 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- ☆18Updated 3 years ago
- Micromega tactics for Mathematical Components☆26Updated 3 weeks ago
- Finite sets and maps for Coq with extensional equality☆30Updated 3 months ago
- ☆37Updated 6 months ago
- A proof of Abel-Ruffini theorem.☆30Updated 3 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆21Updated 4 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 10 months ago
- ☆17Updated 3 years ago
- ☆15Updated last year