Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [maintainer=@palmskog]
-
Updated
Nov 1, 2024 - OCaml
Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [maintainer=@palmskog]
Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]
A Coq tactic for proving multivariate inequalities using SDP solvers
A Coq Tactic for Arithmetic (based on VPL)
Automatic transfer of theorems along isomorphisms in Coq
This respository contains the formalization of different variations of divide-and-conquer algorithm design paradigm for lists. As a case study, we will see how these different variations lead to different sorting algorithms.
My project for a course at Saarland University called "Advanced Coq Programming". My work is limited to the Reflection.v and GeneralReflection.v files, with some slight modifications in PA.v and ZF.v
A tutorial on how to write OCaml tactics for the Coq proof assistant
Add a description, image, and links to the coq-tactic topic page so that developers can more easily learn about it.
To associate your repository with the coq-tactic topic, visit your repo's landing page and select "manage topics."