Jan A. Bergstra - Selected publications #

1. J.A. Bergstra. The continuous functionals and 2E. In J.E. Fenstad, R.O. Gandy and G.E. Sacks eds. Generalized Recursion Theory II. North Holland (1978), p. 39-53.
2. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, Vol. 60 1/3 (1984), p. 109-137.
3. J.A. Bergstra, J. Heering and P. Klint. Module algebra. Journal of the ACM, Vol. 37 2 (1990), p. 335-372.
4. J.C.M. Baeten, J.A. Bergstra and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the Association for Computing Machinery, Vol. 40 No. 3 (1993), p. 653-682.
5. J.A. Bergstra and J.V. Tucker. Equational specifcations, complete term rewriting systems, and computable and semicomputable algebras. Journal of the Association for Computing Machinery, 42 (6) (1996) p. 1194-1230.
6. J.A. Bergstra, T.B. Dinesh, J. Field, and J. Heering. Toward a complete transformational toolkit for compilers. ACM TOPLAS 19, 5 (1997) p. 639-684.
7. Jan A. Bergstra and Alban Ponse. Register-Machine Based Processes. Journal of the ACM 48, 6 (2001), p. 1207-1241.
8. J.A. Bergstra and M.E. Loots. Program algebra for sequential code. Journal of Logic and Algebraic Programming, 51(2) (2002) p. 125-156,
9. J. A. Bergstra, J. V. Tucker: The rational numbers as an abstract data type. Journal of the ACM 54(2): article no.: 7 (2007)
10. J. A. Bergstra, C. A. Middelburg: Thread algebra for strategic interleaving. Formal Aspects of Comput. 19(4) (2007) p. 445-474

Process Algebra (2000)
editors: J.A. Bergstra, A. Ponse & S.A. Smolka

---

History of Information Security (2007)
editors: K.M.M. de Leeuw & J.A. Bergstra