| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Fix an algorithmic issue in Nsatz. |  Pierre-Marie Pédrot | 2017-04-09 |
| We use heaps instead of continuously adding elements to an ordered list, which was quadratic in the worst case. As a byproduct, this solves bug #5359, which was due to a stack overflow on big lists. | |||
 |
index : coq | |
| the Coq proof assistant |
| aboutsummaryrefslogtreecommitdiffhomepage |