Search results
Results: 371
Number of items: 371
-
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., & Ponse, A. (2008). A generic basis theorem for cancellation meadows. ArXiv. http://arxiv.org/abs/0803.3969
-
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. (2008). Instruction sequences for the production of processes. ArXiv. http://arxiv.org/abs/0811.0436v2
-
Bergstra, J., & Burgess, M. (2008). A static theory of promises. ArXiv. http://arxiv.org/abs/0810.3294
-
Bergstra, J. A., & Tucker, J. V. (2008). Division safe calculation in totalised fields. Theory of Computing Systems, 43(3-4), 410-424. https://doi.org/10.1007/s00224-007-9035-4
-
Bergstra, J. A., & Ponse, A. (2008). An instruction sequence semigroup with repeaters. ArXiv. http://arxiv.org/abs/0810.1151v1
-
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). Data linkage dynamics with shedding. ArXiv. http://arxiv.org/abs/0806.4034
Page 19 of 38