[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
# .	set-basic	f	Set[A] → Nat
. ( . )	map	pf	Map[A, B] × A → B with λ st, a. a ∈ st
. ( . := . )	map	f	Map[A, B] × A × B → Map[A, B]
. * .	map-sep	f	(Map[A, B] → Bool) × (Map[A, B] → Bool) → Map[A, B] → Bool
. + .	nat-basic	f	Nat × Nat → Nat
. ++ .	set-basic	f	Set[A] × A → Set[A]
. +1	nat-basic	f	Nat → Nat
. - .	nat	pf	Nat × Nat → Nat with λ n, m. n ≥ m
. -* .	map-sep	f	(Map[A, B] → Bool) × (Map[A, B] → Bool) → Map[A, B] → Bool
. -- .	map	f	Map[A, B] × A → Map[A, B]
. -- .	set-union	f	Set[A] × A → Set[A]
. -> .	map-sep	f	(Map[A, B] → Bool) × (Map[A, B] → Bool) → Map[A, B] → Bool
. -⊗ .	map-sep	f	(Map[A, B] → Bool) × (Map[A, B] → Bool) → Map[A, B] → Bool
. -1	nat-basic	pf	Nat → Nat with λ n. n ≠ 0
. < .	nat-basic	p	Nat × Nat
. => .	refmap-maplet	f	Ref[A] × A → Map[Ref[A], A] → Bool
. =>?	refmap-ex-maplet	f	Ref[A] → Map[Ref[A], A] → Bool
. =>_	refmap-ex-maplet	f	Ref[A] → Map[Ref[A], A] → Bool
. > .	nat	p	Nat × Nat
. \ .	set-union	f	Set[A] × Set[A] → Set[A]
. \ .	heapfuns-map	f	Map[A, B] × Set[A] → Map[A, B]
. \ .	heapfuns-map	f	Map[A, B] × Map[A, B] → Map[A, B]
. ∈ .	map	p	'A × Map('A, 'B)
. ∈ .	set-basic	p	'A × Set('A)
. ∩ .	set-union	f	Set[A] × Set[A] → Set[A]
. ∪ .	set-union	f	Set[A] × Set[A] → Set[A]
. ∪ .	heapfuns-map	f	Map[A, B] × Map[A, B] → Map[A, B]
. ≤ .	nat	p	Nat × Nat
. ≥ .	nat	p	Nat × Nat
. ⊆ .	map	p	Map('A, 'B) × Map('A, 'B)
. ⊆ .	set-basic	p	Set('A) × Set('A)
. ⊆ .	map-sep	p	(Map('A, 'B) → Bool) × (Map('A, 'B) → Bool)
. ⊗ .	map-sep	f	(Map[A, B] → Bool) × (Map[A, B] → Bool) → Map[A, B] → Bool
. ⊥ .	heapfuns-map	p	Map('A, 'B) × Map('A, 'B)
. and .	map-sep	f	(Map[A, B] → Bool) × (Map[A, B] → Bool) → Map[A, B] → Bool
. exists ( . )	set-union	p	Set('A) × ('A → Bool)
. filter ( . )	set-union	f	Set[A] × (A → Bool) → Set[A]
. forall ( . )	set-union	p	Set('A) × ('A → Bool)
. map ( . )	set-union	f	Set[A] × (A → B) → Set[B]
. or .	map-sep	f	(Map[A, B] → Bool) × (Map[A, B] → Bool) → Map[A, B] → Bool
_∃ .	refmap-maplet	f	(B → Map[Ref[A], A] → Bool) → Map[Ref[A], A] → Bool
_∃ .	refmap-maplet	f	(B × C → Map[Ref[A], A] → Bool) → Map[Ref[A], A] → Bool
{ . }	set-union	f	A → Set[A]
{ . }	map-sep	f	Map[A, B] → Map[A, B] → Bool
∅	map	c	Map[A, B]
∅	set-basic	c	Set[A]
⌜ . ⌝	map-sep	f	Bool → Map[A, B] → Bool
Map	map	s
Nat	nat-basic	s
Ref	polyref	s
Set	set-basic	s
disjoint	set-union	p	Set('A) × Set('A)
dom .	heapfuns-map	f	Map[A, B] → Set[A]
emp	map-sep	p	Map('A, 'B)
false	map-sep	p	Map('A, 'B)
h	refmap-ex-maplet	v	Map[Ref[A], A]
hP	refmap-ex-maplet	v	Map[Ref[A], A] → Bool
ite	map-sep	f	Bool × (Map[A, B] → Bool) × (Map[A, B] → Bool) → Map[A, B] → Bool
not .	map-sep	f	(Map[A, B] → Bool) → Map[A, B] → Bool
null	polyref	c	Ref[A]
o	refmap-ex-maplet	v	A
precise	map-sep	p	(Map('A, 'B) → Bool)
r	refmap-ex-maplet	v	Ref[A]
true	map-sep	p	Map('A, 'B)