is mentioned by
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Thm* (L1 swap adjacent[P(x,y)] L2) Thm* ![]() ![]() Thm* (filter(f;L1) swap adjacent[P(x,y)] filter(f;L2)) Thm* ![]() | [filter_swap_adjacent] |
![]() ![]() ![]() ![]() ![]() ![]() Thm* ( ![]() ![]() ![]() ![]() Thm* ![]() ![]() Thm* ( ![]() Thm* ((L guarded_permutation(T; ![]() Thm* (& ( ![]() ![]() ![]() | [partial_sort_exists_2] |
![]() ![]() ![]() ![]() ![]() ![]() ![]() Thm* count(x < y in swap(L;n;n+1) | P(x,y)) Thm* = Thm* count(x < y in L | P(x,y))+if P(L[n],L[(n+1)]) ![]() Thm* count(x < y in L | P(x,y))+if P(L[n],L[(n+1)]) ![]() ![]() Thm* count(x < y in L | P(x,y))+if P(L[n],L[(n+1)]) ![]() Thm* count(x < y in L | P(x,y))+if P(L[n],L[(n+1)]) ![]() | [count_pairs_swap] |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Thm* ( ![]() ![]() Thm* (P(L,i) ![]() ![]() ![]() Thm* ![]() ![]() Thm* ( ![]() Thm* ( ![]() Thm* ((L guarded_permutation(T; ![]() ![]() ![]() ![]() | [partial_sort_exists] |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | [count_pairs_wf] |
![]() ![]() ![]() ![]() ![]() ![]() Thm* (x ![]() ![]() ![]() ![]() ![]() | [member_map_filter] |
![]() ![]() ![]() ![]() ![]() ![]() Thm* mapfilter(f;P;L) ![]() | [mapfilter_wf] |
![]() ![]() ![]() ![]() ![]() ![]() | [no_repeats_filter] |
![]() ![]() ![]() ![]() Thm* x before y ![]() ![]() ![]() ![]() | [l_before_filter] |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | [sublist_filter] |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | [l_all_reduce] |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | [filter_is_nil] |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | [filter_trivial2] |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | [filter_trivial] |
In prior sections: bool 1 rel 1 list 1 sqequal 1 mb nat mb list 1
Try larger context:
MarkB generic
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html