| symbol | specification | entry |
|---|
| # | tree | function,
tree → nat |
| # | heap | function,
heap → nat |
| # | refset | function,
refset → nat |
| # | set-basic | function,
set → nat |
| * | heap-sep | function,
heap → bool × heap → bool → heap → bool |
| + | nat-basic2 | function,
nat × nat → nat |
| ++ | heap | function,
heap × ref → heap |
| ++ | refset | function,
refset × ref → refset |
| ++ | set-basic | function,
set × elem → set |
| +1 | nat-basic1 | function,
nat → nat |
| - | nat | function,
nat × nat → nat |
| -* | heap-sep | function,
heap → bool × heap → bool → heap → bool |
| -- | heap | function,
heap × ref → heap |
| -- | refset | function,
refset × ref → refset |
| -- | set-union | function,
set × elem → set |
| -1 | nat-basic1 | function,
nat → nat |
| -⊗ | heap-sep | function,
heap → bool × heap → bool → heap → bool |
| .butleftmost | search-tree | function,
tree → tree |
| .butmax | oset | function,
set → set |
| .butmin | oset | function,
set → set |
| .insert | search-tree | function,
tree × elem → tree |
| .left | tree | function,
tree → tree |
| .left | node | function,
node → ref |
| .left:= | tree | function,
tree × tree → tree |
| .left:= | node | function,
node × ref → node |
| .leftmost | search-tree | function,
tree → elem |
| .max | oset | function,
set → elem |
| .min | oset | function,
set → elem |
| .right | tree | function,
tree → tree |
| .right | node | function,
node → ref |
| .right:= | tree | function,
tree × tree → tree |
| .right:= | node | function,
node × ref → node |
| .set | data-refinement | function,
tree → set |
| .val | tree | function,
tree → elem |
| .val | node | function,
node → elem |
| .val:= | tree | function,
tree × elem → tree |
| .val:= | node | function,
node × elem → node |
| < | oelem | predicate,
elem × elem |
| < | nat-basic1 | predicate,
nat × nat |
| < | oset | predicate,
set × elem |
| < | oset | predicate,
elem × set |
| => | node-heap | function,
ref × node → heap → bool |
| => | maplet | function,
ref × obj → heap → bool |
| =>? | maplet | function,
ref → heap → bool |
| =>_ | maplet | function,
ref → heap → bool |
| > | nat | predicate,
nat × nat |
| H | heap | variable,
heap |
| H0 | heap | variable,
heap |
| H1 | heap | variable,
heap |
| H2 | heap | variable,
heap |
| P | heap-sep | variable,
heap → bool |
| P0 | heap-sep | variable,
heap → bool |
| P1 | heap-sep | variable,
heap → bool |
| P2 | heap-sep | variable,
heap → bool |
| True | separation | predicate,
bool |
| \ | heap | function,
heap × heap → heap |
| \ | heap | function,
heap × refset → heap |
| \ | refset | function,
refset × refset → refset |
| \ | set-union | function,
set × set → set |
| ] | node-heap | function,
heap × ref × node → heap |
| ] | node-heap | function,
heap × ref → node |
| ] | heap | function,
heap × ref × obj → heap |
| ] | heap | function,
heap × ref → obj |
| _∃ | node-heap | function,
node → heap → bool → heap → bool |
| _∃ | maplet | function,
obj → heap → bool → heap → bool |
| _∃ | maplet | function,
ref × ref → heap → bool → heap → bool |
| _∃ | maplet | function,
ref → heap → bool → heap → bool |
| a | elem | variable,
elem |
| a0 | tree | variable,
elem |
| a0 | node | variable,
elem |
| alloc | ops | procedure,
: ref, heap |
| b | elem | variable,
elem |
| branch | tree | function,
tree × elem × tree → tree |
| bst | search-tree | predicate,
tree |
| bv | heap-sep | variable,
bool |
| c | elem | variable,
elem |
| elem | elem | sort,
|
| emp | heap-sep | predicate,
heap |
| false | heap-sep | predicate,
heap |
| free | ops | procedure,
ref : heap |
| heap | heap | sort,
|
| ite | heap-sep | function,
bool × heap → bool × heap → bool → heap → bool |
| leaf | tree | constant,
tree |
| m | nat-basic1 | variable,
nat |
| mknode | node | function,
ref × elem × ref → node |
| n | nat-basic1 | variable,
nat |
| n0 | nat-basic1 | variable,
nat |
| n1 | nat-basic1 | variable,
nat |
| nat | nat-basic1 | sort,
|
| nd | node | variable,
node |
| nd0 | node-heap | variable,
node |
| nd1 | node-heap | variable,
node |
| node | node | sort,
|
| null | ref | constant,
ref |
| o | obj | variable,
obj |
| o0 | obj | variable,
obj |
| o1 | obj | variable,
obj |
| oP | node-heap | variable,
node → heap → bool |
| oP | maplet | variable,
obj → heap → bool |
| obj | obj | sort,
|
| ordered_set_delete_min | ordered-set | procedure,
: elem, set |
| ordered_set_insert | ordered-set | procedure,
elem : set |
| precise | heap-sep | predicate,
heap → bool |
| r | ref | variable,
ref |
| r0 | ref | variable,
ref |
| r1 | ref | variable,
ref |
| r2 | node | variable,
ref |
| rP | maplet | variable,
ref → heap → bool |
| read | node-heap | procedure,
ref, heap : node |
| read | ops | procedure,
ref, heap : obj |
| ref | ref | sort,
|
| refset | refset | sort,
|
| rrP | maplet | variable,
ref × ref → heap → bool |
| rs | refset | variable,
refset |
| rs0 | refset | variable,
refset |
| rs1 | refset | variable,
refset |
| rs2 | refset | variable,
refset |
| s | set-basic | variable,
set |
| s0 | set-basic | variable,
set |
| s1 | set-basic | variable,
set |
| s2 | set-basic | variable,
set |
| search_tree_delete_min | search-tree | procedure,
: elem, ref, heap |
| search_tree_insert | search-tree | procedure,
elem : ref, heap |
| search_tree_mknode | search-tree | procedure,
ref, elem, ref : ref, heap |
| set | set-basic | sort,
|
| t | tree | variable,
tree |
| t0 | tree | variable,
tree |
| t1 | tree | variable,
tree |
| t2 | tree | variable,
tree |
| tr | linked-tree | function,
ref × tree → heap → bool |
| tree | tree | sort,
|
| true | heap-sep | predicate,
heap |
| write | node-heap | procedure,
ref, node : heap |
| write | ops | procedure,
ref, obj : heap |
| } | heap-sep | function,
heap → heap → bool |
| } | refset | function,
ref → refset |
| } | set-union | function,
elem → set |
| ¬ | heap-sep | function,
heap → bool → heap → bool |
| → | heap-sep | function,
heap → bool × heap → bool → heap → bool |
| ∅ | heap | constant,
heap |
| ∅ | refset | constant,
refset |
| ∅ | set-basic | constant,
set |
| ∈ | search-tree | predicate,
elem × tree |
| ∈ | heap | predicate,
ref × heap |
| ∈ | refset | predicate,
ref × refset |
| ∈ | set-basic | predicate,
elem × set |
| ∧ | heap-sep | function,
heap → bool × heap → bool → heap → bool |
| ∨ | heap-sep | function,
heap → bool × heap → bool → heap → bool |
| ∩ | refset | function,
refset × refset → refset |
| ∩ | set-union | function,
set × set → set |
| ∪ | heap | function,
heap × heap → heap |
| ∪ | refset | function,
refset × refset → refset |
| ∪ | set-union | function,
set × set → set |
| ≡ | separation | predicate,
heap × heap |
| ≤ | nat | predicate,
nat × nat |
| ≥ | nat | predicate,
nat × nat |
| ⊆ | heap-sep | predicate,
heap → bool × heap → bool |
| ⊆ | heap | predicate,
heap × heap |
| ⊆ | refset | predicate,
refset × refset |
| ⊆ | set-basic | predicate,
set × set |
| ⊗ | heap-sep | function,
heap → bool × heap → bool → heap → bool |
| ⊥ | heap | predicate,
heap × heap |
| ⌝ | heap-sep | function,
bool → heap → bool |