Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 371
Number of items: 371
  • Open Access
    Bergstra, J. A., & Ponse, A. (2008). Differential meadows. ArXiv. http://arxiv.org/abs/0804.3336v1
  • Open Access
    Bergstra, J. A., & Middelburg, C. A. (2008). Instruction sequences and non-uniform complexity theory. ArXiv. http://arxiv.org/abs/0809.0352
  • Open Access
    Bergstra, J., & Burgess, M. (2008). A static theory of promises. ArXiv. http://arxiv.org/abs/0810.3294
  • Open Access
    Bergstra, J. A., & Ponse, A. (2008). A generic basis theorem for cancellation meadows. ArXiv. http://arxiv.org/abs/0803.3969
  • Open Access
    Bergstra, J. A., & Ponse, A. (2008). An instruction sequence semigroup with repeaters. ArXiv. http://arxiv.org/abs/0810.1151v1
  • Open Access
    Bergstra, J. A., Ponse, A., & van der Zwaag, M. B. (2008). Tuplix calculus. Scientific Annals of Computer Science, 18, 35-61. http://www.info.uaic.ro/bin/Annals/Article?v=XVIII&a=2
  • Bergstra, J. A., & Bethke, I. (2007). Predictable and Reliable Program Code: Virtual Machine-Based Projection Semantics. In J. A. Bergstra, & M. Burgess (Eds.), Handbook of Network and System Administration (pp. 653-658). Elsevier.
  • de Leeuw, K. M. M., & Bergstra, J. A. (2007). The History of Information Security: A Comprehensive Handbook. Elsevier.
  • Bergstra, J. A., & Burgess, M. (2007). Handbook of Network and System Administration. Elsevier.
  • Bergstra, J. A., Bethke, I., & Burgess, M. (2007). A Process Algebra Based Framework for Promise Theory. (PRG technical report). ArXiv. http://arxiv.org/abs/0707.0744
Page 20 of 38