next node: [ un ] to [ wc ],
prev node: [ st ],
up to node: Function Index By Codomain

Function Index By Codomain [ su ] to [ tr ]

[ a ] [ al ] [ an ] [ ar ] [ b ] [ ba ] [ bi ] [ bo ] [ bs ] [ ca ] [ ch ] [ co ] [ cu ] [ da ] [ de ] [ do ] [ dr ] [ dy ] [ ei ] [ en ] [ ev ] [ fi ] [ fm ] [ fo ] [ fr ] [ fu ] [ gr ] [ he ] [ ic ] [ im ] [ in ] [ is ] [ it ] [ jo ] [ ju ] [ ma ] [ mo ] [ na ] [ op ] [ or ] [ ou ] [ pa ] [ pe ] [ po ] [ pr ] [ qu ] [ ra ] [ re ] [ ro ] [ sc ] [ se ] [ si ] [ so ] [ sr ] [ st ] [ su ] [ ta ] [ ti ] [ to ] [ tr ] [ un ] [ us ] [ ve ] [ vi ] [ vo ] [ wc ] [ wd ] [ wi ] [ wr ]

su

subrel < subrel
subrel = subrel
subrel |= subrel

ta

tag all tag
tag current tag
tag selection tag
tag tag denotation -> tag
tag tag index -> tag
tag tag modifier -> tag

ti

time atime filestat -> time
time ctime filestat -> time
time mtime filestat -> time

to

to / (char ** to -> to) ** to ** string -> to
to / (char ** to -> to) ** to -> string -> to
to / (codom ** to -> to) ** to ** map[dom, <, codom] -> to : [1], [2], [3]
to / (codom ** to -> to) ** to ** natMap[codom] -> to
to / (codom ** to -> to) ** to -> map[dom, <, codom] -> to : [1], [2]
to / (dom ** codom ** data ** to -> to) ** to ** rel[dom, <, codom, <, data] -> to
to / (dom ** codom ** to -> to) ** to ** map[dom, <, codom] -> to : [1], [2], [3]
to / (dom ** codom ** to -> to) ** to -> map[dom, <, codom] -> to : [1], [2]
to / (from ** nat ** to -> to) ** to ** bag[from, <] -> to
to / (from ** nat ** to -> to) ** to -> bag[from, <] -> to
to / (from ** to ** to -> to) ** to ** bstree[from, <] -> to
to / (from ** to ** to -> to) ** to ** heap[from, <] -> to
to / (from ** to ** to -> to) ** to ** tree[from] -> to
to / (from ** to -> to) ** to ** array[from] -> to
to / (from ** to -> to) ** to ** bag[from, <] -> to
to / (from ** to -> to) ** to ** dArray[from] -> to
to / (from ** to -> to) ** to ** heap[from, <] -> to
to / (from ** to -> to) ** to ** seq[from] -> to
to / (from ** to -> to) ** to ** set[from, <] -> to : [1], [2]
to / (from ** to -> to) ** to -> array[from] -> to
to / (from ** to -> to) ** to -> bag[from, <] -> to
to / (from ** to -> to) ** to -> seq[from] -> to
to / (from ** to -> to) ** to -> set[from, <] -> to
to / (nat ** codom ** to -> to) ** to ** natMap[codom] -> to
to / (nat ** from ** to -> to) ** to ** array[from] -> to
to / (nat ** from ** to -> to) ** to ** dArray[from] -> to
to / (nat ** from ** to -> to) ** to -> array[from] -> to
to / (nat ** to -> to) ** to ** set -> to
to /_in (from ** to -> to) ** to ** bstree[from, <] -> to
to /_in (from ** to -> to) ** to ** heap[from, <] -> to
to /_in (from ** to -> to) ** to ** tree[from] -> to
to /_post (from ** to -> to) ** to ** bstree[from, <] -> to
to /_post (from ** to -> to) ** to ** heap[from, <] -> to
to /_post (from ** to -> to) ** to ** tree[from] -> to
to /_pre (from ** to -> to) ** to ** bstree[from, <] -> to
to /_pre (from ** to -> to) ** to ** heap[from, <] -> to
to /_pre (from ** to -> to) ** to ** tree[from] -> to
to @ funct ** from -> to
to \ (char ** to -> to) ** to ** string -> to
to \ (char ** to -> to) ** to -> string -> to
to \ (from ** to -> to) ** to ** array[from] -> to
to \ (from ** to -> to) ** to ** dArray[from] -> to
to \ (from ** to -> to) ** to ** seq[from] -> to
to \ (from ** to -> to) ** to -> array[from] -> to
to \ (from ** to -> to) ** to -> seq[from] -> to
to \ (nat ** from ** to -> to) ** to ** array[from] -> to
to \ (nat ** from ** to -> to) ** to ** dArray[from] -> to
to \ (nat ** from ** to -> to) ** to -> array[from] -> to
to accelerate from ** from -> to : [1], [2]
to cast from -> to
to funct funct -> from -> to
to quick from -> to
to quick to
to reduce (from ** to -> to) ** to ** seq[from] -> to
to reduce (from ** to -> to) ** to -> seq[from] -> to
to slow from ** from -> to : [1], [2]

tr

tree % data -> tree
tree :=_left tree ** tree -> tree
tree :=_right tree ** tree -> tree
tree :=_val tree ** data -> tree
tree < (data ** data -> bool) -> tree ** tree -> bool
tree = (data ** data -> bool) -> tree ** tree -> bool
tree iter (data -> option[data] ** option[data]) ** option[data] -> tree
tree left tree -> tree
tree lrotate tree -> tree
tree nil tree
tree node data ** tree ** tree -> tree
tree reflect tree -> tree
tree right tree -> tree
tree rrotate tree -> tree
tree swap tree -> tree
tree[data] ! tree[data] ** nat -> tree[data]
tree[data] ` (data -> denotation) -> tree[data] -> denotation
tree[data] ` (data -> string) -> tree[data] -> string
tree[data] asTree bstree[data, <] -> tree[data]
tree[data] asTree heap[data, <] -> tree[data]
tree[data] delete tree[data] ** nat -> tree[data]
tree[data] drop (data -> bool) ** tree[data] -> tree[data]
tree[data] dropall (data -> bool) ** tree[data] -> tree[data]
tree[data] graphic (data -> denotation) -> tree[data] -> denotation
tree[data] graphic (data -> string) -> tree[data] -> string
tree[data] insert tree[data] ** nat ** tree[data] -> tree[data]
tree[data] repl tree[data] ** nat ** (tree[data] -> tree[data]) -> tree[data]
tree[data] repl tree[data] ** nat ** tree[data] -> tree[data]
tree[data] step tree[data] ** nat -> tree[data] ** nat
tree[data] take (data -> bool) ** tree[data] -> tree[data]
tree[data] upd nat ** (data -> data) ** tree[data] -> tree[data]
tree[data] upd nat ** data ** tree[data] -> tree[data]
tree[from1] unzip (to -> from1 ** from2) ** tree[to] -> tree[from1] ** tree[from2]
tree[from2] unzip (to -> from1 ** from2) ** tree[to] -> tree[from1] ** tree[from2]
tree[pair[data, nat]] balance tree[pair[data, nat]] -> tree[pair[data, nat]]
tree[pair[data, nat]] dlrotate tree[pair[data, nat]] -> tree[pair[data, nat]]
tree[pair[data, nat]] drrotate tree[pair[data, nat]] -> tree[pair[data, nat]]
tree[pair[data, nat]] lrotate tree[pair[data, nat]] -> tree[pair[data, nat]]
tree[pair[data, nat]] rep bstree -> tree[pair[data, nat]]
tree[pair[data, nat]] rrotate tree[pair[data, nat]] -> tree[pair[data, nat]]
tree[to] * (from -> to) ** tree[from] -> tree[to]
tree[to] *_^ (env ** env ** from -> env ** to) ** env ** tree[from] -> env ** tree[to]
tree[to] *_in (env ** from -> env ** to) ** env ** tree[from] -> env ** tree[to]
tree[to] *_post (env ** from -> env ** to) ** env ** tree[from] -> env ** tree[to]
tree[to] *_pre (env ** from -> env ** to) ** env ** tree[from] -> env ** tree[to]
tree[to] *_V (env ** from -> env ** env ** to) ** env ** tree[from] -> tree[to]
tree[to] zip (from1 ** from2 -> to) ** tree[from1] ** tree[from2] -> tree[to]
triple & data1 ** data2 ** data3 -> triple
triple[data1, data2, data3] ` (data1 -> denotation) ** (data2 -> denotation) ** (data3 -> denotation) -> triple[data1, data2, data3] -> denotation
triple[data1, data2, data3] ` denotation ** denotation ** denotation -> (data1 -> denotation) ** (data2 -> denotation) ** (data3 -> denotation) -> triple[data1, data2, data3] -> denotation
triple[data11, data21, data31] * (data1 -> data11) ** (data2 -> data21) ** (data3 -> data31) ** triple[data1, data2, data3] -> triple[data11, data21, data31]

next node: [ un ] to [ wc ],
prev node: [ st ],
up to node: Function Index By Codomain