Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 371
Number of items: 371
  • Bergstra, J. A., & Middelburg, C. A. (2006). Splitting bisimulations and retrospective conditions. Information and Computation, 204(7), 1083-1138. https://doi.org/10.1016/j.ic.2006.03.003
  • Bergstra, J. A. (2006). Elementary algebraic specifications of the rational function field. In A. Beckmann, U. Berger, B. Löwe, & J. V. Tucker (Eds.), Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings (Vol. 3988, pp. 40-54). Springer-Verlag.
  • Bergstra, J. A., & Tucker, J. V. (2006). Elementary algebraic specifications of the rational complex numbers. In K. Futatsugi, J.-P. Jouannaud, & J. Messeguer (Eds.), Algebra, Meaning, and Computations (Vol. 4060, pp. 459-475). Springer-Verlag.
  • Bergstra, J. A., & Middelburg, C. A. (2006). Continuity controlled hybrid automata. The Journal of Logic and Algebraic Programming, 68(1-2), 5-53. https://doi.org/10.1016/j.jlap.2005.10.002
  • Bergstra, J. A., & Middelburg, C. A. (2006). Thread algebra with multi-level strategies. Fundamenta Informaticae, 71(2/3), 153-182.
  • 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., & 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.
Page 25 of 38