Towards a Characterization of Two-way Bijections in a Reversible Computational Model

We introduce an imperative, stack-based, and reversible computational model that characterizes Two-way Bijections both implicitly, concerning their computational complexity, and with zero-garbage.