[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
# .	heap	f	Heap[A] → Nat
# .	set-basic	f	Set[A] → Nat
# .	list-data	f	List[A] → Nat
. '	list	f	A → List[A]
. ( . )	heap	pf	Heap[A] × Ref[A] → A with λ h, r. r ≠ null ∧ r ∈ h
. ( . := . )	heap	pf	Heap[A] × Ref[A] × A → Heap[A] with λ h, r, o. r ≠ null ∧ r ∈ h
. * .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. + .	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]
. ++ .	set-basic	f	Set[A] × A → Set[A]
. ++ .	list-dup	f	List[A] × A → List[A]
. ++ .	heap	pf	Heap[A] × Ref[A] → Heap[A] with λ h, r. r ≠ null ∧ ¬ r ∈ h
. +1	nat-basic	f	Nat → Nat
. +2 .	list	f	A × A → List[A]
. - .	nat	pf	Nat × Nat → Nat with λ n, m. n ≥ m
. -* .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. -- .	set-union	f	Set[A] × A → Set[A]
. -- .	heap	pf	Heap[A] × Ref[A] → Heap[A] with λ h, r. r ≠ null ∧ r ∈ h
. -> .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. -⊗ .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. -1	nat-basic	pf	Nat → Nat with λ n. n ≠ 0
. < .	nat-basic	p	Nat × Nat
. < .	list-data	p	List('A) × List('A)
. => .	maplet	f	Ref[A] × A → Heap[A] → Bool
. =>?	ex-maplet	f	Ref[A] → Heap[A] → Bool
. =>_	ex-maplet	f	Ref[A] → Heap[A] → Bool
. > .	nat	p	Nat × Nat
. \ .	set-union	f	Set[A] × Set[A] → Set[A]
. \ .	heapfuns	f	Heap[A] × Set[Ref[A]] → Heap[A]
. \ .	heapfuns	f	Heap[A] × Heap[A] → Heap[A]
. × .	cell	f	A × Ref[Cell[A]] → Cell[A]
. ∈ .	heap	p	Ref('A) × Heap('A)
. ∈ .	set-basic	p	'A × Set('A)
. ∈ .	list	p	'A × List('A)
. ∩ .	set-union	f	Set[A] × Set[A] → Set[A]
. ∪ .	set-union	f	Set[A] × Set[A] → Set[A]
. ∪ .	heapfuns	f	Heap[A] × Heap[A] → Heap[A]
. ≡ .	separation	p	Heap('A) × Heap('A)
. ≤ .	nat	p	Nat × Nat
. ≥ .	nat	p	Nat × Nat
. ⊆ .	set-basic	p	Set('A) × Set('A)
. ⊆ .	heapfuns	p	Heap('A) × Heap('A)
. ⊆ .	heap-sep	p	(Heap('A) → Bool) × (Heap('A) → Bool)
. ⊑ .	list-last	p	List('A) × List('A)
. ⊒ .	list-last	p	List('A) × List('A)
. ⊗ .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. ⊥ .	heapfuns	p	Heap('A) × Heap('A)
. and .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. butlast	list-last	pf	List[A] → List[A] with λ x. x ≠ []
. distinct	list-dup	f	List[A] → List[A]
. dropRight ( . )	list-last	pf	List[A] × Nat → List[A] with λ x, n. n ≤ # x
. exists ( . )	set-union	p	Set('A) × ('A → Bool)
. filter ( . )	set-union	f	Set[A] × (A → Bool) → Set[A]
. foldLeft ( . )	list	f	List[A] × B × (B × A → B) → B
. forall ( . )	set-union	p	Set('A) × ('A → Bool)
. head	list-data	pf	List[A] → A with λ x. x ≠ []
. last	list-last	pf	List[A] → A with λ x. x ≠ []
. map ( . )	set-union	f	Set[A] × (A → B) → Set[B]
. map ( . )	list	f	List[A] × (A → B) → List[B]
. nxt	cell	f	Cell[A] → Ref[Cell[A]]
. nxt:= .	cell	f	Cell[A] × Ref[Cell[A]] → Cell[A]
. or .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. tail	list-data	pf	List[A] → List[A] with λ x. x ≠ []
. val	cell	f	Cell[A] → A
. val:= .	cell	f	Cell[A] × A → Cell[A]
[]	list-data	c	List[A]
_∃ .	maplet	f	(B → Heap[A] → Bool) → Heap[A] → Bool
_∃ .	maplet	f	(B × C → Heap[A] → Bool) → Heap[A] → Bool
_∃ .	maplet	f	(B × C × D → Heap[A] → Bool) → Heap[A] → Bool
{ . }	set-union	f	A → Set[A]
{ . }	heap-sep	f	Heap[A] → Heap[A] → Bool
∅	heap	c	Heap[A]
∅	set-basic	c	Set[A]
⌜ . ⌝	heap-sep	f	Bool → Heap[A] → Bool
Cell	cell	s
Heap	heap	s
List	list-data	s
Nat	nat-basic	s
Ref	polyref	s
Set	set-basic	s
True	separation	p	Bool
a	linked-list-seg	v	A
alloc#	heap	pr	: Heap[A] → Ref[A] (nondeterministic)
b	linked-list-seg	v	A
c	linked-list-seg	v	A
ce	linked-list-seg	v	Cell[A]
disj	list-dup	p	List('A) × List('A)
disjoint	set-union	p	Set('A) × Set('A)
dom .	heapfuns	f	Heap[A] → Set[Ref[A]]
dups	list-dup	p	List('A)
emp	heap-sep	p	Heap('A)
false	heap-sep	p	Heap('A)
fillfirst	list-last	f	Nat × A × List[A] → List[A]
h	linked-list-seg	v	Heap[Cell[A]]
hP	linked-list-seg	v	Heap[Cell[A]] → Bool
ite	heap-sep	f	Bool × (Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
ll-lasso	linked-list-seg	f	Ref[Cell[A]] × List[A] → Heap[Cell[A]] → Bool
ll-trav	linked-list-seg	f	Ref[Cell[A]] × Ref[Cell[A]] × List[A] → Heap[Cell[A]] → Bool
ll-trav	linked-list-seg	f	Ref[Cell[A]] × Ref[Cell[A]] × Ref[Cell[A]] × List[A] → Heap[Cell[A]] → Bool
lls	linked-list-seg	f	Ref[Cell[A]] × Ref[Cell[A]] × List[A] → Heap[Cell[A]] → Bool
ls	linked-list	f	Ref[Cell[A]] × List[A] → Heap[Cell[A]] → Bool
mklist	list-last	f	A × Nat → List[A]
not .	heap-sep	f	(Heap[A] → Bool) → Heap[A] → Bool
null	polyref	c	Ref[A]
precise	heap-sep	p	(Heap('A) → Bool)
r	linked-list-seg	v	Ref[Cell[A]]
rev	list-last	f	List[A] → List[A]
true	heap-sep	p	Heap('A)
x	linked-list-seg	v	List[A]
y	linked-list-seg	v	List[A]
z	linked-list-seg	v	List[A]