2 research outputs found
arXiv:0909.2089v1 [cs.PL] 11 Sep 2009
Abstract. Instruction sequences with direct and indirect jump instructions are as expressive as instruction sequences with direct jump instructions only. We show that, in the case where the number of instructions is not bounded, there exist instruction sequences of the former kind from which elimination of indirect jump instructions is possible without a super-linear increase of their maximal internal delay on execution only at the cost of a super-linear increase of their length
UvA-DARE (Digital Academic Repository) Division by Zero in Non-involutive Meadows
Abstract. Meadows have been proposed as alternatives for fields with a purely equational axiomatization. At the basis of meadows lies the decision to make the multiplicative inverse operation total by imposing that the multiplicative inverse of zero is zero. Thus, the multiplicative inverse operation of a meadow is an involution. In this paper, we study 'noninvolutive meadows', i.e. variants of meadows in which the multiplicative inverse of zero is not zero, and pay special attention to non-involutive meadows in which the multiplicative inverse of zero is one