stablesort
Sorting library
Provides a modular and canonical way to prove the correctness of stable sorting algorithms in Coq.
Stable sort algorithms and their stability proofs in Coq
22 stars
2 watching
1 forks
Language: Coq
last commit: 2 months ago
Linked from 2 awesome lists
coqinsertion-sortmathcompmergesortsorting-algorithmsssreflect
uhub/awesome-coqRelated projects:
| Repository | Description | Stars |
|---|---|---|
 timsort/cpp-timsort | A C++ implementation of TimSort, an O(n log n) stable sorting algorithm. | 299 |
 coq-community/fav-ssr | A comprehensive library of verified data structures and algorithms in Coq | 45 |
| coq-community/alea | A library for reasoning about randomized algorithms in Coq | 25 |
 morwenn/cpp-sort | A C++14 header-only sorting library providing a flexible and generic way to implement various sorting algorithms | 622 |
 swenson/sort | A comprehensive C sorting library providing various stable and unstable algorithms with generic implementations | 463 |
| coq-community/coqeal | A Coq library providing algebraic data structures and algorithms | 66 |
 stoeffel/mergesort | An efficient sorting algorithm with O(n log n) complexity. | 20 |
 vafeiadis/hahn | A collection of lemmas and tactics about lists and binary relations for a proof assistant | 30 |
| coq-community/parseque | A Coq library that provides a total parser combinator library with support for building parsers and grammars in the language of Coq. | 42 |
 scandum/quadsort | A branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data | 2,135 |
| coq-community/lemma-overloading | A Coq library demonstrating design patterns for automated proof automation and canonical structures | 26 |
 hivert/coq-combi | Formalizes algebraic combinatorics in Coq with an emphasis on symmetric functions and their properties. | 1 |
 verse-lab/ceramist | A verified hash-based approximate membership structure library in Coq | 121 |
 felix-petersen/diffsort | A library that allows gradients to be propagated through sorting operations, enabling differentiable sorting networks. | 106 |