WhoCites Definitions MarkB generic Sections NuprlLIB Doc

Who Cites permute list?
permute_listDef (L o f) == mklist(||L||;i.L[(f(i))])
Thm* T:Type, L:T List, f:(||L||||L||). (L o f) T List
select Def l[i] == hd(nth_tl(i;l))
Thm* A:Type, l:A List, n:. 0n n < ||l|| l[n] A
length Def ||as|| == Case of as; nil 0 ; a.as' ||as'||+1 (recursive)
Thm* A:Type, l:A List. ||l||
Thm* ||nil||
mklist Def mklist(n;f) == primrec(n;nil;i,l. l @ [(f(i))])
Thm* T:Type, n:, f:(nT). mklist(n;f) T List
nth_tl Def nth_tl(n;as) == if n0 as else nth_tl(n-1;tl(as)) fi (recursive)
Thm* A:Type, as:A List, i:. nth_tl(i;as) A List
hd Def hd(l) == Case of l; nil "?" ; h.t h
Thm* A:Type, l:A List. ||l||1 hd(l) A
Thm* A:Type, l:A List. hd(l) A
append Def as @ bs == Case of as; nil bs ; a.as' [a / (as' @ bs)] (recursive)
Thm* T:Type, as,bs:T List. (as @ bs) T List
primrec Def primrec(n;b;c) == if n=0 b else c(n-1,primrec(n-1;b;c)) fi (recursive)
Thm* T:Type, n:, b:T, c:(nTT). primrec(n;b;c) T
tl Def tl(l) == Case of l; nil nil ; h.t t
Thm* A:Type, l:A List. tl(l) A List
le_int Def ij == j < i
Thm* i,j:. (ij)
eq_int Def i=j == if i=j true ; false fi
Thm* i,j:. (i=j)
lt_int Def i < j == if i < j true ; false fi
Thm* i,j:. (i < j)
bnot Def b == if b false else true fi
Thm* b:. b

Syntax:(L o f) has structure: permute_list(L; f)

About:
listconsconsnillist_ind
boolbfalsebtrueifthenelseintnatural_numberaddsubtract
int_eqlessless_thantokenlambdaapply
functionrecursive_def_noticeuniversememberimpliesall
!abstraction

WhoCites Definitions MarkB generic Sections NuprlLIB Doc