Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 52
Number of items: 52
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2006). Decision problems for pushdown threads. The Bulletin of Symbolic Logic, 12, 311-312.
  • Bergstra, J. A., & Bethke, I. (2006). Predictable and Reliable Program Code: Virtual Machine-based Projection Semantics. Programming Research Group, UvA.
  • Bergstra, J. A., & Bethke, I. (2005). Network algebra in Java. The Journal of Logic and Algebraic Programming, 62(2), 247-271. https://doi.org/10.1016/j.jlap.2004.03.011
  • Bergstra, J. A., & Bethke, I. (2005). An upper bound for the equational specification of finite state services. Information Processing Letters, 94(6), 267-269. https://doi.org/10.1016/j.ipl.2005.02.010
  • Bergstra, J. A., & Bethke, I. (2005). Polarized process algebra with reactive composition. Theoretical Computer Science, 343, 285-304. https://doi.org/10.1016/j.tcs.2005.06.014
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2005). Decision Problems for Pushdown Threads. (PRG0502). Informatics Institute.
  • Bergstra, J. A., & Bethke, I. (2004). Linear Projective Program Syntax. (Logic Group Preprint Series; No. 233). Universiteit van Utrecht.
  • Bergstra, J. A., & Bethke, I. (2003). Polarized Process Algebra and Program Equivalence. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, & G. J. Woeginger (Eds.), Automata, Languages and Programming, 30th International Colloquium, ICALP 2003 (Vol. 2719, pp. 1-21). Springer.
  • Bethke, I., & Ponse, A. (2003). Programma-Algebra, een inleiding tot de Programmatuur. Vossiuspers UvA.
  • Bethke, I. (2003). Lambda calculus. In Terese (Ed.), Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science (pp. 548-587). (45). Cambridge University Press.
Page 4 of 6