Abstract
Let A be a structure with the property that every flow-chart with one stack /every recursive schema/, total over A, is strongly equivalent in A to a loop-free schema. We show that every total flow-chart with one stack can be unwound in A.
Get full access to this article
View all access options for this article.