Search results
Results: 371
Number of items: 371
-
Bergstra, J. A., & Middelburg, C. A. (2021). Using Hoare Logic in a Process Algebra Setting. Fundamenta Informaticae, 179(4), 321-344. https://doi.org/10.3233/FI-2021-2026 -
Bergstra, J. A., & Ponse, A. (2021). Datatype defining rewrite systems for naturals and integers. Logical Methods in Computer Science, 17(1), Article 17. https://doi.org/10.23638/LMCS-17(1:17)2021
-
Bergstra, J. A., & Burgess, M. (2021). Promise Theory and the Alignment of Context, Processes, Types, and Transforms. Transmathematica, 2021. https://doi.org/10.36285/tm.43
-
Bergstra, J. A., & Ponse, A. (2021). Division by zero in common meadows. (v4 ed.) ArXiv. https://doi.org/10.48550/arXiv.1406.6878
-
Bergstra, J. A., & Middelburg, C. A. (2020). On the complexity of the correctness problem for non-zeroness test instruction sequences. Theoretical Computer Science, 802, 1-18. https://doi.org/10.1016/j.tcs.2019.03.040
-
Bergstra, J. A. (2020). Most general algebraic specifications for an abstract datatype of rational numbers. Scientific Annals of Computer Science, 30(1), 1-24. https://doi.org/10.7561/SACS.2020.1.1
-
Bergstra, J. A., & Ponse, A. (2020). Arithmetical datatypes with true fractions. Acta Informatica, 57(3-5), 385-402. https://doi.org/10.1007/s00236-019-00352-8
-
Bergstra, J. A., & Ponse, A. (2019). Division by zero in common meadows. (v3 ed.) ArXiv. https://doi.org/10.48550/arXiv.1406.6878
-
Bergstra, J. A., & Middelburg, C. A. (2019). Using Hoare logic in a process algebra setting. (v2 ed.) ArXiv. https://doi.org/10.48550/arXiv.1906.04491
-
Bergstra, J. A. (2019). Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers. Computer Science Journal of Moldova, 27(2 (80)), 131-161. http://www.math.md/en/publications/csjm/issues/v27-n2/12969/
Page 3 of 38