We call each iteration of a topmost looping subgoal a round.
The top of the deposit was somewhat eroded, so that the topmost sample probably does not represent the end of the explosive eruption.
Each cluster of interdependent subgoals as represented by a topmost looping subgoal is iteratively evaluated until no subgoal in it can produce any new answers.
Linear tabling relies on iterative evaluation of topmost looping subgoals to compute fixpoints.
This instruction swaps the two topmost elements of the stack, provided the topmost one is a closure and the other one is a tree node.
This is the topmost part of the sequence.
In their model, only the topmost constraint gets to evaluate the full candidate set, so that constraints are not functions.
The topmost element denotes the function whose body we are currently inspecting.
