Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 368
Number of items: 368
  • Bergstra, J. A., & Sellink, M. P. A. (1996). Sequential data algebra primitives. (Technical Report; No. P9602). onbekend (FdL).
  • van de Pol, J. C. (1996). Termination of Higher-Order Rewrite Systems. [Thesis, fully external, UU].
  • Bergstra, J. A., & Klint, P. (1996). The Discrete Time ToolBus. In M. Nivat, & M. Wirsing (Eds.), Algebraic Methodology and Software Technology (AMAST) (pp. 286-305). (LNCS; No. 1101). Springer-Verlag.
  • Bergstra, J. A., Fokkink, W. J., & Middelburg, C. A. (1996). Algebra of timed frames. International Journal of Computer Mathematics, 61, 227-255. https://doi.org/10.1080/00207169608804514
  • Open Access
    Bergstra, J. A., & Tucker, J. V. (1996). Equational specifications, complete term rewriting systems, and computable and semicomputable algebras. Journal of the Association for Computing Machinery, 42(6), 1194-1230. https://doi.org/10.1145/227683.227687
  • Open Access
    Baeten, J. A., & Bergstra, J. A. (1996). Discrete time process algebra. Formal Aspects of Computing, 8, 286-305.
  • Bergstra, J. A., Bethke, I., & Rodenburg, P. H. (1995). A propositional logic with four values: true, false, divergent and meaningless. Journal of Applied Non-Classical Logics, 5, 199-217.
  • Veltink, G. J. (1995). Tools for PSF. [Thesis, fully internal, Universiteit van Amsterdam].
  • Bergstra, J. A., Fokkink, W. J., & Middelburg, C. A. (1995). Algebra of timed frames. (Logic Group Preprint Series; No. 148). Utrecht University.
  • Bergstra, J. A., & Middelburg, C. A. (1995). Process algebra semantics of $\varphi${SDL}. (Logic Group Preprint Series; No. 129). Utrecht University.
Page 33 of 37