Search results
Results: 132
Number of items: 132
-
Bergstra, J. A., & Middelburg, C. A. (2008). Program algebra with a jump-shift instruction. Journal of Applied Logic, 6(4), 553-563. https://doi.org/10.1016/j.jal.2008.07.001
-
Bergstra, J. A., & Middelburg, C. A. (2008). Maurer computers for pipelined instruction processing. Mathematical Structures in Computer Science, 18(02), 373-409. https://doi.org/10.1017/S0960129507006548 -
Bergstra, J. A., & Middelburg, C. A. (2008). Parallel processes with implicit computational capital. Electronic Notes in Theoretical Computer Science, 209, 55-81. https://doi.org/10.1016/j.entcs.2008.04.004
-
Bergstra, J. A., & Middelburg, C. A. (2008). Data linkage algebra, data linkage dynamics, and priority rewriting. ArXiv. http://arxiv.org/abs/0804.4565
-
Bergstra, J. A., & Middelburg, C. A. (2008). Instruction sequences and non-uniform complexity theory. ArXiv. http://arxiv.org/abs/0809.0352
-
Bergstra, J. A., & Middelburg, C. A. (2008). Thread algebra for poly-threading. ArXiv. http://arxiv.org/abs/0803.0378
-
Bergstra, J. A., & Middelburg, C. A. (2007). Preferential choice and coordination conditions. The Journal of Logic and Algebraic Programming, 70, 172-200. https://doi.org/10.1016/j.jlap.2006.08.004
-
Bergstra, J. A., & Middelburg, C. A. (2007). Thread algebra for strategic interleaving. Formal Aspects of Computing, 19, 445-474. https://doi.org/10.1007/s00165-007-0024-9
-
Bergstra, J. A., & Middelburg, C. A. (2007). A thread algebra with multi-level strategic interleaving. Theory of Computing Systems, 41, 3-32. https://doi.org/10.1007/s00224-006-1337-4
Page 10 of 14