The Tree Evaluation read machine on tuples #
The halting test, the address and the step of Cslib.TreeEval.Reader.machine, written on the
tuples of Cslib.TreeEval.Reader.State.toTuple as chains of tests on finite tags. In this form
they are built from basic functions, which is how their work space is bounded.
Main definitions #
Main results #
Cslib.TreeEval.Reader.haltT_toTuple,Cslib.TreeEval.Reader.addrT_toTuple,Cslib.TreeEval.Reader.stepT_toTuple: they agree with the machine.
@[reducible, inline]
The value length.
Instances For
@[reducible, inline]
The height.
Instances For
@[reducible, inline]
The prime.
Instances For
@[reducible, inline]
The registers.
Instances For
@[reducible, inline]
The stack.
Instances For
@[reducible, inline]
The mode.
Instances For
@[reducible, inline]
The tag of the control state.
Instances For
@[reducible, inline]
The first number of the control state.
Instances For
@[reducible, inline]
The second number of the control state.
Instances For
@[reducible, inline]
The list of the control state.
Instances For
The offset in the encoding of the node at the path of a stack.
Instances For
@[reducible, inline]
The default frame, standing for the top of an empty stack.