16 citations · 106 across the 22 of their papers we have counts for
4 papers · 1 filter
On the expressiveness of single-pass instruction sequences
J. A. Bergstra, C. A. Middelburg
We perceive programs as single-pass instruction sequences. A single-pass instruction sequence under execution is considered to produce a behaviour to be controlled by some executio…
Data linkage dynamics with shedding
J. A. Bergstra, C. A. Middelburg
We study shedding in the setting of data linkage dynamics, a simple model of computation that bears on the use of dynamic data structures in programming. Shedding is complementary…
Data linkage algebra, data linkage dynamics, and priority rewriting
J. A. Bergstra, C. A. Middelburg
We introduce an algebra of data linkages. Data linkages are intended for modelling the states of computations in which dynamic data structures are involved. We present a simple mod…
Thread algebra for poly-threading
J. A. Bergstra, C. A. Middelburg
Threads as considered in basic thread algebra are primarily looked upon as behaviours exhibited by sequential programs on execution. It is a fact of life that sequential programs a…