Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 371
Number of items: 371
  • Bergstra, J. A., & Tucker, J. V. (2005). The rational numbers as an abstract data type. (CSR-12-2005). University of Wales at Swansea (Dept. of Computer Science).
  • Bergstra, J. A., & Ponse, A. (2005). A bypass of Cohen's impossibility result. Lecture Notes in Computer Science, 3470, 1097-1106.
  • Bergstra, J. A., & Middelburg, C. A. (2005). Model theory for process algebra. Lecture Notes in Computer Science, 3838, 445-495.
  • Bergstra, J. A., & Middelburg, C. A. (2005). A thread algebra with multi-level strategic interleaving. Lecture Notes in Computer Science, 3526, 25-48.
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2005). Decision Problems for Pushdown Threads. (PRG0502). Informatics Institute.
  • Bergstra, J. A., & Klint, P. (2005). About 'trivial' software patents: the IsNot case. (SEN-R0517). CWI.
  • Bergstra, J. A., & Middelburg, C. A. (2005). Maurer Computers with single-thread control. (05-17). TU/e CS.
  • Bergstra, J. A., & Middelburg, C. A. (2005). Strong splitting bisimulation equivalence. In J. L. Fiadeiro, N. Harman, M. Roggenbach, & J. Rutten (Eds.), Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005. Proceedings (pp. 85-99). (Lecture Notes in Computer Science; Vol. 3629). Springer. https://doi.org/10.1007/11548133_6
  • Open Access
    Delen, G. P. A. J. (2005). Decision- en controlfactoren voor IT-sourcing. [Thesis, fully internal, Universiteit van Amsterdam]. Van Haren.
  • Bergstra, J. A., & Middelburg, C. A. (2004). Located Actions in Process Algebra with Timing. Fundamenta Informaticae, 64, 183-211.
Page 26 of 38