Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 371
Number of items: 371
  • Open Access
    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/
  • Open Access
    Bergstra, J. A., & Ponse, A. (2019). Division by zero in common meadows. (v3 ed.) ArXiv. https://doi.org/10.48550/arXiv.1406.6878
  • Open Access
    Bergstra, J. A. (2019). Division by Zero: A Survey of Options. Transmathematica, 2019. https://doi.org/10.36285/tm.v0i0.17
  • Open Access
    Bergstra, J. A., & Middelburg, C. A. (2019). Program Algebra for Turing-Machine Programs. Scientific Annals of Computer Science, 29(2), 113-139. https://doi.org/10.7561/SACS.2019.2.113
  • Open Access
    Bergstra, J. A., & Middelburg, C. A. (2018). Instruction sequences expressing multiplication algorithms. Scientific Annals of Computer Science, 28(1), 39-66. https://doi.org/10.7561/SACS.2018.1.39
  • Open Access
    Bergstra, J. A., Ponse, A., & Staudt, D. J. C. (2018). Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant. ArXiv. https://arxiv.org/abs/1810.02142
  • Open Access
    Bergstra, J. A., & Middelburg, C. A. (2018). A Short Introduction to Program Algebra with Instructions for Boolean Registers. Computer Science Journal of Moldova, 26(3 (78)), 199-232. http://www.math.md/publications/csjm/issues/v26-n3/12735/
  • Bergstra, J. A., & Ponse, A. (2017). Probability Functions in the Context of Signed Involutive Meadows: Extended Abstract. In P. James, & M. Roggenbach (Eds.), Recent Trends in Algebraic Development Techniques: 23rd IFIP WG 1.3 International Workshop, WADT 2016, Gregynog, UK, September 21–24, 2016 : revised selected papers (pp. 73–87). (Lecture Notes in Computer Science; Vol. 10644). Springer. https://doi.org/10.1007/978-3-319-72044-9_6
  • Bergstra, J. A., & Middelburg, C. A. (2017). Contradiction-tolerant process algebra with propositional signals. Fundamenta Informaticae, 153(1-2), 29-55. https://doi.org/10.3233/FI-2017-1530
  • Open Access
    Bergstra, J. A., & Middelburg, C. A. (2017). Axioms for behavioural congruence of single-pass instruction sequences. Scientific Annals of Computer Science, 27(2), 111-135. https://doi.org/10.7561/SACS.2017.2.111
Page 4 of 38