Search results
Results: 371
Number of items: 371
-
Bergstra, J. A., & Heering, J. (1995). Homomorphism preserving algebraic specifications require hidden sorts. Information and Computation, 119(1), 119-123. https://doi.org/10.1006/inco.1995.1079 -
Bergstra, J. A., & Tucker, J. V. (1995). Equational specifications, complete term rewriting systems, and computable and. Journal of the Association for Computing Machinery, 42(6), 1194-1230. https://doi.org/10.1145/227683.227687 -
Bergstra, J. A., & Tucker, J. V. (1995). The data type variety of stack algebras. Annals of Pure and Applied Logic, 73, 11-36. https://doi.org/10.1016/0168-0072(94)00038-5 -
Bergstra, J. A., Ponse, A., & van Wamel, J. J. (1994). Process Algebra with Backtracking. In J. W. de Bakker, W.-P. de Roever, & G. Rozenberg (Eds.), A Decade of Concurrency Reflections and Perspectives: REX School/Symposium Noordwijkerhout, The Netherlands June 1–4, 1993 : proceedings (pp. 46-91). (Lecture Notes in Computer Science; Vol. 803). Springer. https://doi.org/10.1007/3-540-58043-3_17
Page 36 of 38