Program algebra with a jump-shift instruction

Simple item page
dc.creatorBergstra, J. A.
dc.creatorMiddelburg, C. A.
dc.date2007-12-11
dc.date.accessioned2026-07-07T10:16:56Z
dc.date.available2026-07-07T10:16:56Z
dc.descriptionWe study sequential programs that are instruction sequences with jump-shift instructions in the setting of PGA (ProGram Algebra). Jump-shift instructions preceding a jump instruction increase the position to jump to. The jump-shift instruction is not found in programming practice. Its merit is that the expressive power of PGA extended with the jump-shift instruction, is not reduced if the reach of jump instructions is bounded. This is used to show that there exists a finite-state execution mechanism that by making use of a counter can produce each finite-state thread from some program that is a finite or periodic infinite sequence of instructions from a finite set.
dc.description19 pages
dc.identifierhttps://arxiv.org/abs/0712.1658
dc.identifierhttp://arxiv.org/abs/0712.1658
dc.identifierJournal of Applied Logic, 6(4):553--563, 2008
dc.identifierdoi:10.1016/j.jal.2008.07.001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173686
dc.subjectProgramming Languages
dc.subjectD.3.1; D.3.3; F.1.1; F.3.2; F.3.3
dc.titleProgram algebra with a jump-shift instruction
dc.typetext

Files

Collections

arXiv