thery / PolTacLinks
Tactic for polynomial manipulations
☆12Updated 4 months ago
Alternatives and similar repositories for PolTac
Users that are interested in PolTac are comparing it to the libraries listed below
Sorting:
- ☆13Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- a version of the 2048 game for Coq☆22Updated last year
- Formalising session types in Coq☆17Updated 6 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆34Updated this week
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 4 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last month
- Research material of Erik Palmgren (1963–2019)☆21Updated 5 months ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆33Updated last year
- Example Coq plugin☆17Updated 7 years ago
- A fornalisation of Grobner basis in ssreflect☆12Updated 2 months ago
- IO for Gallina☆33Updated 3 months ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆27Updated 2 years ago
- An OCaml EDSL for describing and solving strategic games☆17Updated 2 years ago
- Lenses in Coq☆17Updated 2 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- Efficient binder representation in OCaml☆43Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated 11 months ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆21Updated last year