[Imprint][Data Privacy Statement][E-Mail]

Back to the index. View project statistic. View project symbols. View KIV symbols to check that all symbols are available.

All project symbols

symbol specification entry
#refsetfunction, refset → nat
#set-basicfunction, set → nat
#treefunction, tree → nat
#heapfunction, heap → nat
%int-divfunction, int × int → int
*int-multfunction, int × int → int
*heap-sepfunction, heap → bool × heap → bool → heap → bool
+int-basic2function, int × int → int
+nat-basic2function, nat × nat → nat
++refsetfunction, refset × ref → refset
++set-basicfunction, set × elem → set
++heapfunction, heap × ref → heap
+1int-basic1function, int → int
+1nat-basic1function, nat → nat
-int-absfunction, int × int → int
-natfunction, nat × nat → nat
-*heap-sepfunction, heap → bool × heap → bool → heap → bool
--refsetfunction, refset × ref → refset
--set-unionfunction, set × elem → set
--heapfunction, heap × ref → heap
-1int-basic1function, int → int
-1nat-basic1function, nat → nat
-⊗heap-sepfunction, heap → bool × heap → bool → heap → bool
.lefttreefunction, tree → tree
.leftnodefunction, node → ref
.left:=treefunction, tree × tree → tree
.left:=nodefunction, node × ref → node
.righttreefunction, tree → tree
.rightnodefunction, node → ref
.right:=treefunction, tree × tree → tree
.right:=nodefunction, node × ref → node
.valint-treefunction, node → int
.valint-treefunction, tree → int
.valtreefunction, tree → elem
.valnodefunction, node → elem
.val:=int-treefunction, node × int → node
.val:=int-treefunction, tree × int → tree
.val:=treefunction, tree × elem → tree
.val:=nodefunction, node × elem → node
/int-divfunction, int × int → int
<int-basic1predicate, int × int
<nat-basic1predicate, nat × nat
=>node-heapfunction, ref × node → heap → bool
=>mapletfunction, ref × obj → heap → bool
=>?mapletfunction, ref → heap → bool
=>_mapletfunction, ref → heap → bool
>int-abspredicate, int × int
>natpredicate, nat × nat
Boolvarint-treevariable, bool,flexible
Hheapvariable, heap
H0heapvariable, heap
H1heapvariable, heap
H2heapvariable, heap
MAX#challenge2procedure, ref : int × heap
Pheap-sepvariable, heap → bool
P0heap-sepvariable, heap → bool
P1heap-sepvariable, heap → bool
P2heap-sepvariable, heap → bool
Trueseparationpredicate, bool
\refsetfunction, refset × refset → refset
\set-unionfunction, set × set → set
\heapfunction, heap × refset → heap
\heapfunction, heap × heap → heap
]node-heapfunction, heap × ref → node
]node-heapfunction, heap × ref × node → heap
]heapfunction, heap × ref → obj
]heapfunction, heap × ref × obj → heap
_∃node-heapfunction, node → heap → bool → heap → bool
_∃mapletfunction, ref → heap → bool → heap → bool
_∃mapletfunction, ref × ref → heap → bool → heap → bool
_∃mapletfunction, obj → heap → bool → heap → bool
aelemvariable, elem
a0treevariable, elem
a0nodevariable, elem
absint-absfunction, int → int
allocopsprocedure, : ref × heap
belemvariable, elem
boolvarint-treevariable, bool
boolvar0int-treevariable, bool
boolvar1int-treevariable, bool
branchint-treefunction, tree × int × tree → tree
branchtreefunction, tree × elem × tree → tree
bvheap-sepvariable, bool
celemvariable, elem
dummy#challenge2procedure, : heap
elemelemsort,
empheap-seppredicate, heap
evenint-minpredicate, int
falseheap-seppredicate, heap
freeopsprocedure, ref : heap
heapheapsort,
iint-basic1variable, int
i0int-basic1variable, int
i1int-treevariable, int
intint-basic1sort,
jint-basic1variable, int
j0int-basic1variable, int
leaftreeconstant, tree
mnat-basic2variable, nat
maxchallenge2function, tree → int
maxint-minfunction, int × int → int
minint-minfunction, int × int → int
mknodeint-treefunction, ref × int × ref → node
mknodenodefunction, ref × elem × ref → node
nnat-basic1variable, nat
n0nat-basic1variable, nat
n1nat-basic1variable, nat
natnat-basic1sort,
ndnodevariable, node
nd0node-heapvariable, node
nd1node-heapvariable, node
nodenodesort,
nullrefconstant, ref
oobjvariable, obj
o0objvariable, obj
o1objvariable, obj
oPnode-heapvariable, node → heap → bool
oPmapletvariable, obj → heap → bool
objobjsort,
oddint-minpredicate, int
preciseheap-seppredicate, heap → bool
rrefvariable, ref
r0refvariable, ref
r1refvariable, ref
r2nodevariable, ref
rPmapletvariable, ref → heap → bool
readopsprocedure, ref × heap : obj
readnode-heapprocedure, ref × heap : node
refrefsort,
refsetrefsetsort,
rrPmapletvariable, ref × ref → heap → bool
rsrefsetvariable, refset
rs0refsetvariable, refset
rs1refsetvariable, refset
rs2refsetvariable, refset
sset-basicvariable, set
s0set-basicvariable, set
s1set-basicvariable, set
s2set-basicvariable, set
setset-basicsort,
sgnint-minfunction, int → int
ttreevariable, tree
t0treevariable, tree
t1treevariable, tree
t2treevariable, tree
trlinked-treefunction, ref × tree → heap → bool
treetreesort,
trueheap-seppredicate, heap
writeopsprocedure, ref × obj : heap
writenode-heapprocedure, ref × node : heap
}refsetfunction, ref → refset
}set-unionfunction, elem → set
}heap-sepfunction, heap → heap → bool
~int-absfunction, int → int
≤int-abspredicate, int × int
≤natpredicate, nat × nat
≥int-abspredicate, int × int
≥natpredicate, nat × nat
→heap-sepfunction, heap → bool × heap → bool → heap → bool
∈refsetpredicate, ref × refset
∈set-basicpredicate, elem × set
∈challenge2predicate, int × tree
∈heappredicate, ref × heap
¬heap-sepfunction, heap → bool → heap → bool
∪refsetfunction, refset × refset → refset
∪set-unionfunction, set × set → set
∪heapfunction, heap × heap → heap
∩refsetfunction, refset × refset → refset
∩set-unionfunction, set × set → set
∧heap-sepfunction, heap → bool × heap → bool → heap → bool
∨heap-sepfunction, heap → bool × heap → bool → heap → bool
⊥heappredicate, heap × heap
⊆refsetpredicate, refset × refset
⊆set-basicpredicate, set × set
⊆heap-seppredicate, heap → bool × heap → bool
≡separationpredicate, heap × heap
∅refsetconstant, refset
∅set-basicconstant, set
∅heapconstant, heap
⌝heap-sepfunction, bool → heap → bool