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: 5 months ago
Linked from 2 awesome lists
coqinsertion-sortmathcompmergesortsorting-algorithmsssreflect
Related projects:
Repository | Description | Stars |
---|---|---|
| A C++ implementation of TimSort, an O(n log n) stable sorting algorithm. | 303 |
| A comprehensive library of verified data structures and algorithms in Coq | 45 |
| A library for reasoning about randomized algorithms in Coq | 25 |
| A C++14 header-only sorting library providing a flexible and generic way to implement various sorting algorithms | 629 |
| A comprehensive C sorting library providing various stable and unstable algorithms with generic implementations | 464 |
| A Coq library providing algebraic data structures and algorithms | 67 |
| An efficient sorting algorithm with O(n log n) complexity. | 20 |
| A collection of lemmas and tactics about lists and binary relations for a proof assistant | 30 |
| A Coq library that provides a total parser combinator library with support for building parsers and grammars in the language of Coq. | 42 |
| A branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data | 2,137 |
| A Coq library demonstrating design patterns for automated proof automation and canonical structures | 26 |
| An algebraic combinatorics library formalized in Coq, providing a comprehensive set of functions and theories for symmetric functions. | 1 |
| A verified hash-based approximate membership structure library in Coq | 121 |
| A library that allows gradients to be propagated through sorting operations, enabling differentiable sorting networks. | 107 |