Table Of Content

Theoretical Computer Science Theoretical Computer Science 177 (1997) 509 Author index volume 177 (1997) (The issue number is given in front of the page numbers) Anderson, S.O. and A.J. Power, A representable approach to finite nondeterminism (1) 3- 25 Baeten, J.C.M. and J.A. Bergstra, Process algebra with propositional signals (2) 381-405 Bergstra, J.A., see J.C.M. Baeten (2) 381-405 Bezem, M. and A. Ponse, Two finite specifications of a queue (2) 487-507 Braiiner, T., A general adequacy result for a linear functional language (1) 27- 58 Bucciarelli, A., Degrees of parallelism in the continuous type hierarchy (1) S9- 71 Cockett, J.R.B. and D.A. Spooner, Constructing process categories (1) 73-109 D’Argenio, P.R. and C. Verhoef, A general conservative extension theorem in process algebras with inequalities (2) 351-380 Esik, Z., Completeness of Park induction (1) 217-283 Flagg, B. and R. Kopperman, Continuity spaces: Reconciling domains and metric spaces (1) 111-138 Fokkink, W. and H. Zantema, Termination modulo equations by abstract communication with an application to iteration (2) 407—423 Fredlund, L., J.F. Groote and H. Korver, Formal verification of a leader election protocol in process algebra (2) 459-486 Groote, J.F., see L. Fredlund (2) 459-486 Kopperman, R., see B. Flagg (1) 111-138 Korver, H., see L. Fredlund (2) 459-486 Leavens, G.T. and D. Pigozzi, The behavior—realization adjunction and generalized homomorphic relations (1) 183-216 Mislove, M.W. and D.A. Schmidt, Foreword (i) 1 Nolte, D. and L. Priese, Abstract fairness and semantics (1) 139-153 Pigozzi, D., see G.T. Leavens (1) 183-216 (2) 487-507 Ponse, A., see M. Bezem Ponse, A., C. Verhoef and B. van Vlijmen, Preface (2) 285-286 Power, A.J., see S.O. Anderson oe +s Priese, L., see D. Nolte (1) 139-153 Rounds, W.C., see G.-Q. Zhang (1) 155-182 Schmidt, D.A., see M.V. Mislove (i) 1 (1) 73-109 Spooner, D.A., see J.R.B. Cockett (2) 329-349 van Glabbeek, R.J., Notes on the methodology of CCS and CSP van Vlijmen, B., see A. Ponse (2) 285-286 (2) 425-458 van Wamel, J., Process algebra with language matching Verhoef, C., see P.R. D’Argenio (2) 351-380 Verhoef, C., see A. Ponse (2) 285-286 (2) 287-328 Vrancken, J.L.M., The algebra of communicating processes with empty process Zantema, H., see W. Fokkink (2) 407-423 (1) 155-182 Zhang, G.-Q. and W.C. Rounds, Defaults in domain theory Elsevier Science B.V.