Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 371
Number of items: 371
  • Bergstra, J. A., & Ponse, A. (2006). Interface Groups for Analytic Execution Architectures. Programming Research Group, UvA.
  • Bergstra, J. A., & Ponse, A. (2006). Program Algebra with Repeat Instruction. Programming Research Group, UvA.
  • Bergstra, J. A., & Bethke, I. (2006). Predictable and Reliable Program Code: Virtual Machine-based Projection Semantics. Programming Research Group, UvA.
  • Bergstra, J. A., & Ponse, A. (2006). Projection Semantics for Rigid Loops. Programming Research Group, UvA.
  • Bergstra, J. A., & Tucker, J. V. (2006). Division Safe Calculation in Totalised Fields. Programming Research Group, UvA.
  • Bergstra, J. A., & Burgess, M. (2006). Local and Global Trust Based on the Concept of Promises. Programming Research Group, UvA.
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2006). Decision problems for pushdown threads. The Bulletin of Symbolic Logic, 12, 311-312.
  • Bergstra, J. A., & Ponse, A. (2006). A bypass of Cohen's impossibility result: Extended version (in html). VX Heaven, Library. http://vx.netlux.org/lib/mjb00.html
  • 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.
Page 24 of 38