276771e6ca
TODO: prove the result is sorted, prove that l1 ~ l2 -> sort R l1 = sort R l2 |
||
---|---|---|
.. | ||
as_type.lean | ||
basic.lean | ||
comb.lean | ||
default.lean | ||
list.md | ||
perm.lean | ||
set.lean | ||
sort.lean | ||
sorted.lean |
276771e6ca
TODO: prove the result is sorted, prove that l1 ~ l2 -> sort R l1 = sort R l2 |
||
---|---|---|
.. | ||
as_type.lean | ||
basic.lean | ||
comb.lean | ||
default.lean | ||
list.md | ||
perm.lean | ||
set.lean | ||
sort.lean | ||
sorted.lean |