Refereed Papers

J. A. Bergstra, A. Ponse, and M. B. van der Zwaag (2008). Tuplix calculus. Scientific Annals of Computer Science, 18:35–61. Retrievable from http://www.info.uaic.ro/bin/Annals/XVIII (freely available)

J. A. Bergstra and I. Bethke (2010). Straight-line instruction sequence completeness for total calculation on cancellation meadows. Theory of Computing Systems, 48(4):840–864. doi:10.1007/s00224-010-9272-9 (freely available)

J. A. Bergstra and C. A. Middelburg (2013a). Data linkage algebra, data linkage dynamics, and priority rewriting. Fundamenta Informaticae, 128(4):367–412. doi:10.3233/FI-2013-950 (postprint: arXiv:0804.4565v4 [cs.LO])

J. A. Bergstra and C. A. Middelburg (2013b). A process calculus with finitary comprehended terms. Theory of Computing Systems, 53(4):645–668. doi:10.1007/s00224-013-9468-x (postprint: arXiv:0903.2914v3 [cs.LO])

J. A. Bergstra and C. A. Middelburg (2013c). Timed tuplix calculus and the Wesseling and van den Bergh equation. Scientific Annals of Computer Science, 23(2):169–190. doi:10.7561/SACS.2013.2.169 (freely available)

J. A. Bergstra and I. Bethke (2015c). Note on paraconsistency and reasoning about fractions. Journal of Applied Non-Classical Logics, 25(2):120–124. doi:10.1080/11663081.2015.1047232 (postprint: arXiv:1410.8692v2 [cs.LO])

J. A. Bergstra and C. A. Middelburg (2015c). Probabilistic thread algebra. Scientific Annals of Computer Science, 25(2):211–243. doi:10.7561/SACS.2015.2.211 (freely available)

J. A. Bergstra and A. Ponse (2016). Fracpairs and fractions over a reduced commutative ring. Indagationes Mathematicae, 27(3):727–748. doi:10.1016/j.indag.2016.01.007 (postprint: arXiv:1411.4410v2 [math.RA])

Papers are ordered by year of publication. If two or more publications have the same year of publication, then they are further ordered by surnames of the authors. If two or more publications have the same year of publication and the same surnames of the authors, then they are further ordered by title of the paper.
Advertisements