[Imprint][Data Privacy Statement][E-Mail]

Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Signature symbols in this unit

Symbol	Specification	Kind	Type
# .	list-data	f	List[A] → Nat
#oc	list-perm	f	A × List[A] → Nat
. '	list	f	A → List[A]
. ( . )	list-getput	pf	List[A] × Nat → A with λ x, n. n < # x
. ( . := . )	list-getput	pf	List[A] × Nat × A → List[A] with λ x, n, a. n < # x
. + .	nat-basic	f	Nat × Nat → Nat
. + .	list-data	f	A × List[A] → List[A]
. + .	list	f	List[A] × List[A] → List[A]
. + .	list	f	List[A] × A → List[A]
. ++ .	list-dup	f	List[A] × A → List[A]
. +1	nat-basic	f	Nat → Nat
. +2 .	list	f	A × A → List[A]
. - .	nat	pf	Nat × Nat → Nat with λ n, m. n ≥ m
. -1	nat-basic	pf	Nat → Nat with λ n. n ≠ 0
. -1l .	list-del	f	List[A] × A → List[A]
. -l .	list-del	f	List[A] × A → List[A]
. -p .	list-del	f	List[A] × Nat → List[A]
. < .	nat-basic	p	Nat × Nat
. < .	list-data	p	List('A) × List('A)
. < .	tord	p	Tord × Tord
. > .	nat	p	Nat × Nat
. \ .	list-set	f	List[A] × List[A] → List[A]
. ∈ .	list	p	'A × List('A)
. ∪ .	list-set	f	List[A] × List[A] → List[A]
. ≤ .	nat	p	Nat × Nat
. ≥ .	nat	p	Nat × Nat
. ⊆ .	list-set	p	List('A) × List('A)
. ⊆m .	list-perm	p	List('A) × List('A)
. ⊑ .	list-last	p	List('A) × List('A)
. ⊒ .	list-last	p	List('A) × List('A)
. butlast	list-last	pf	List[A] → List[A] with λ x. x ≠ []
. count ( . )	filter-count	f	List[A] × (A → Bool) → Nat
. count ( . )	filter-count	pf	List[A] × Nat × Nat × (A → Bool) → Nat with λ x, m, n, p. m ≤ n ∧ n ≤ # x
. distinct	list-dup	f	List[A] → List[A]
. drop ( . )	list-del	pf	List[A] × Nat → List[A] with λ x, n. n ≤ # x
. dropRight ( . )	list-last	pf	List[A] × Nat → List[A] with λ x, n. n ≤ # x
. filter ( . )	filter-count	f	List[A] × (A → Bool) → List[A]
. foldLeft ( . )	list	f	List[A] × B × (B × A → B) → B
. head	list-data	pf	List[A] → A with λ x. x ≠ []
. indexOf ( . )	list-del	f	List[A] × A → Nat
. intersect .	list-set	f	List[A] × List[A] → List[A]
. last	list-last	pf	List[A] → A with λ x. x ≠ []
. map ( . )	list	f	List[A] × (A → B) → List[B]
. sublist ( . )	list-del	pf	List[A] × Nat × Nat → List[A] with λ x, n, m. n + m ≤ # x
. tail	list-data	pf	List[A] → List[A] with λ x. x ≠ []
. take ( . )	list-del	pf	List[A] × Nat → List[A] with λ x, n. n ≤ # x
. takeRight ( . )	list-del	pf	List[A] × Nat → List[A] with λ x, n. n ≤ # x
. zip .	filter-count	f	List[A] × List[B] → List[(A, B)]
[]	list-data	c	List[A]
List	list-data	s
Nat	nat-basic	s
Tord	tord	s
a	olist-min-max	v	Tord
all<	olist-min-max	p	List(Tord) × Tord
all<	olist-min-max	p	List(Tord) × Nat × Nat × Tord
all>	olist-min-max	p	List(Tord) × Tord
all>	olist-min-max	p	List(Tord) × Nat × Nat × Tord
all≤	olist-min-max	p	List(Tord) × Tord
all≤	olist-min-max	p	List(Tord) × Nat × Nat × Tord
all≥	olist-min-max	p	List(Tord) × Tord
all≥	olist-min-max	p	List(Tord) × Nat × Nat × Tord
b	olist-min-max	v	Tord
disj	list-dup	p	List('A) × List('A)
dups	list-dup	p	List('A)
fillfirst	list-last	f	Nat × A × List[A] → List[A]
frome	list-del	f	List[A] × A → List[A]
ins≤	olist	f	Tord × List[Tord] → List[Tord]
m	olist-min-max	v	Nat
max	tord-min-max	f	Tord × Tord → Tord
max	olist-min-max	pf	List[Tord] → Tord with λ x. x ≠ []
merge	olist	f	List[Tord] × List[Tord] → List[Tord]
min	tord-min-max	f	Tord × Tord → Tord
min	olist-min-max	pf	List[Tord] → Tord with λ x. x ≠ []
mklist	list-last	f	A × Nat → List[A]
n	olist-min-max	v	Nat
ordered<	olist	p	List(Tord)
ordered≤	olist	p	List(Tord)
perm	list-perm	p	List('A) × List('A)
rev	list-last	f	List[A] → List[A]
sort	olist-sort	f	List[Tord] → List[Tord]
x	olist-min-max	v	List[Tord]
y	olist-min-max	v	List[A]