previous
|
index
|
next
Axioms for RA-Stacks
Equations that state relationships among the ADT procedures:
Pushing an item onto a stack should result in the item being on the top:
(top-minus (push!
ra-stack
item
) 0) =
item
previous
|
index
|
next