[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
. '	list	f	A → List[A]
. ( . )	list-getput	pf	List[A] × Nat → A with λ x, n. n < # x
. ( . )	assoclist	pf	List[(A, B)] × A → B with λ ax, a. a ∈ ax
. ( . := . )	assoclist	f	List[(A, B)] × A × B → List[(A, B)]
. ( . := . )	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)
. > .	nat	p	Nat × Nat
. [ . ]r	assoclist	pf	List[(A, B)] × B → A with λ ax, d. ∃ a. (a, d) ∈ ax
. ∈ .	list	p	'A × List('A)
. ∈ .	assoclist	p	'A × List(('A, 'B))
. ≤ .	nat	p	Nat × Nat
. ≥ .	nat	p	Nat × Nat
. ⊑ .	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 ≠ []
. 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
. 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
. 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
[]	list-data	c	List[A]
List	list-data	s
Nat	nat-basic	s
a	assoclist	v	A
ax	assoclist	v	List[(A, B)]
b	assoclist	v	A
d	assoclist	v	B
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]
mklist	list-last	f	A × Nat → List[A]
p	assoclist	v	(A, B)
rev	list-last	f	List[A] → List[A]
unique_al	assoclist	p	List(('A, 'B))