[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
# .	map	f	Map[A, B] → Nat
# .	list-data	f	List[A] → Nat
. '	list	f	A → List[A]
. ( . )	map	pf	Map[A, B] × A → B with λ st, a. a ∈ st
. ( . )	list-getput	pf	List[A] × Nat → A with λ x, n. n < # x
. ( . := . )	map	f	Map[A, B] × A × B → Map[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
. -- .	map	f	Map[A, B] × A → Map[A, B]
. -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
. \ .	list-set	f	List[A] × List[A] → List[A]
. ∈ .	map	p	'A × Map('A, 'B)
. ∈ .	list	p	'A × List('A)
. ∪ .	list-set	f	List[A] × List[A] → List[A]
. ≤ .	nat	p	Nat × Nat
. ≥ .	nat	p	Nat × Nat
. ⊆ .	map	p	Map('A, 'B) × Map('A, 'B)
. ⊆ .	list-set	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 ≠ []
. 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
. 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]
. nxt	lincell	f	Cell → Ref
. 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]
∅	map	c	Map[A, B]
Cell	lincell	s
List	list-data	s
Map	map	s
Nat	nat-basic	s
Ref	Ref	s
ce	path-reachable	v	Cell
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]
h	path-reachable	v	Map[Ref, Cell]
m	path-reachable	v	Nat
mklist	list-last	f	A × Nat → List[A]
n	path-reachable	v	Nat
null	Ref	c	Ref
path	path-reachable	p	List(Ref) × Map(Ref, Cell)
r	path-reachable	v	Ref
reachable	path-reachable	p	Ref × Ref × Map(Ref, Cell)
reachable*	path-reachable	p	Map(Ref, Cell) × Ref × Ref
reachable-1	path-reachable	p	Map(Ref, Cell) × Ref × Ref
reachable-n	path-reachable	p	Map(Ref, Cell) × Nat × Ref × Ref
rev	list-last	f	List[A] → List[A]
x	path-reachable	v	List[Ref]
y	path-reachable	v	List[Ref]