[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
# .	refset	f	refset → nat
# .	heap	f	heap → nat
# .	store	f	store → nat
. * .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. + .	nat-basic	f	nat × nat → nat
. ++ .	refset	f	refset × ref → refset
. ++ .	heap	f	heap × ref → heap
. +1	nat-basic	f	nat → nat
. - .	nat	pf	nat × nat → nat with λ n, m. n ≥ m
. -* .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. -- .	refset	f	refset × ref → refset
. -- .	heap	f	heap × ref → heap
. -- .	store	f	store × elem → store
. -> .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. -⊗ .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. -1	nat-basic	pf	nat → nat with λ n. n ≠ 0
. < .	nat-basic	p	nat × nat
. => .	maplet	f	ref × obj → heap → bool
. =>?	maplet	f	ref → heap → bool
. =>_	maplet	f	ref → heap → bool
. > .	nat	p	nat × nat
. [ . ]	heap	f	heap × ref → obj
. [ . ]	heap	f	heap × ref × obj → heap
. [ . ]	store	f	store × elem × data → store
. [ . ]	store	pf	store × elem → data with λ st, a. a ∈ st
. \ .	refset	f	refset × refset → refset
. \ .	heap	f	heap × refset → heap
. \ .	heap	f	heap × heap → heap
. ∈ .	refset	p	ref × refset
. ∈ .	heap	p	ref × heap
. ∈ .	store	p	elem × store
. ∧_ .	iter-store	f	(elem × data → heap → bool) × store → heap → bool
. ∩ .	refset	f	refset × refset → refset
. ∪ .	refset	f	refset × refset → refset
. ∪ .	heap	f	heap × heap → heap
. ≤ .	nat	p	nat × nat
. ≥ .	nat	p	nat × nat
. ⊆ .	refset	p	refset × refset
. ⊆ .	heap	p	heap × heap
. ⊆ .	heap-sep	p	(heap → bool) × (heap → bool)
. ⊆ .	store	p	store × store
. ⊗ .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. ⊗_ .	iter-store	f	(elem × data → heap → bool) × store → heap → bool
. ⊥ .	heap	p	heap × heap
. and .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. or .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
_∃ .	maplet	f	(ref → heap → bool) → heap → bool
_∃ .	maplet	f	(ref × ref → heap → bool) → heap → bool
_∃ .	maplet	f	(obj → heap → bool) → heap → bool
{ . }	refset	f	ref → refset
{ . }	heap-sep	f	heap → heap → bool
∅	refset	c	refset
∅	heap	c	heap
∅	store	c	store
⌜ . ⌝	heap-sep	f	bool → heap → bool
a	iter-store	v	elem
adP	iter-store	v	elem × data → heap → bool
d	iter-store	v	data
data	data	s
dom .	heap	f	heap → refset
elem	elem	s
emp	heap-sep	p	heap
false	heap-sep	p	heap
h	iter-store	v	heap
hP	iter-store	v	heap → bool
heap	heap	s
ite	heap-sep	f	bool × (heap → bool) × (heap → bool) → heap → bool
nat	nat-basic	s
not .	heap-sep	f	(heap → bool) → heap → bool
null	ref	c	ref
obj	obj	s
precise	heap-sep	p	(heap → bool)
ref	ref	s
refset	refset	s
st	iter-store	v	store
store	store	s
true	heap-sep	p	heap