| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2017-12-29 | Adding skewed lists. | Pierre-Marie Pédrot | |
| This is a purely functional datastructure isomorphic to usual lists, except that it features a O(log n) lookup while preserving the O(1) cons operation. | |||
![]() |
index : coq | |
| The formal proof system |
| aboutsummaryrefslogtreecommitdiff |
| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2017-12-29 | Adding skewed lists. | Pierre-Marie Pédrot | |
| This is a purely functional datastructure isomorphic to usual lists, except that it features a O(log n) lookup while preserving the O(1) cons operation. | |||