Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 52
Number of items: 52
  • Open Access
    Bethke, I., Rodenburg, P., & Sevenster, A. (2009). The structure of finite meadows. ArXiv. http://arxiv.org/abs/0903.1196
  • Open Access
    Bergstra, J. A., & Bethke, I. (2009). Square root meadows. ArXiv. http://arxiv.org/abs/0901.4664
  • Open Access
    Bergstra, J. A., & Bethke, I. (2009). Straight-line instruction sequence completeness for total calculation on cancellation meadows. ArXiv. http://arxiv.org/abs/0905.4612
  • Open Access
    Bethke, I., & Rodenburg, P. (2008). The initial meadows. ArXiv. http://arxiv.org/abs/0806.2256v1
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2007). Decision problems for pushdown threads. Acta Informatica, 44, 75-90. https://doi.org/10.1007/s00236-007-0040-5
  • Bethke, I., & Rodenburg, P. H. (2007). Some properties of finite meadows. ArXiv. http://arxiv.org/abs/0712.0917
  • 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.
  • 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
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2007). Thread algebra and risk assessment services. In C. Dimitracopoulos, L. Newelski, & D. Normann (Eds.), Proceedings Logic Colloquium 2005 (Vol. 28, pp. 1-17). Cambridge University Press.
  • Open Access
    Vu, T. D. (2007). Semantics and applications of process and program algebra. [Thesis, fully internal, Universiteit van Amsterdam].
Page 3 of 6