Index: doc/theses/andrew_beach_MMath/implement.tex
===================================================================
--- doc/theses/andrew_beach_MMath/implement.tex	(revision 79c14d6f1ed3e70159b0d70352c5ad63944eb790)
+++ doc/theses/andrew_beach_MMath/implement.tex	(revision 12b4ab4fd4899665bc1cafa544e60e949b59533b)
@@ -407,4 +407,20 @@
 statement, cause the function to return true.
 
+% Recursive Resumption Stuff:
+Blocking out part of the stack is accomplished by updating the front of the
+list as the search continues. Before the handler at a node is called the head
+of the list is updated to the next node of the current node. After the search
+is complete, successful or not, the head of the list is reset.
+
+This means the current handler and every handler that has already been
+checked are not on the list while a handler is run. If a resumption is thrown
+during the handling of another resumption the active handlers and all the
+other handler checked up to this point will not be checked again.
+
+This structure also supports new handler added while the resumption is being
+handled. These are added to the front of the list, pointing back along the
+stack -- the first one will point over all the checked handlers -- and the
+ordering is maintained.
+
 \subsection{Libunwind Compatibility}
 Resumption does not use libunwind for two simple reasons. The first is that