Theoretical Computer Science 1999: Vol 211 Table of Contents

1 Pages·1999·0.12 MB·English

Theoretical Computer Science
Logic, semantics and theory of programming
Volume 211, Numbers 1-2, 28 January 1999
Abstracted Indexed in: ACM Computing Reviews, Compuscience, Computer Abstracts,
Current Contents: Engineering, Technology & Applied Science, Engineering Index 'Com-
pendex, INSPEC Information Services, Mathematical Reviews, Zentralblatt fiir Mathematik
Contents
Fundamental Studies
M. Koutny and E. Best
Operational and denotational semantics for the box algebra
G.M. Reed and A.W. Roscoe
The times failures — Stability model for CSP
M. Stone
Representing scope in intuitionistic deductions
Contributions
Y. Sun
An algebraic generalization of Frege structures — binding algebras
A.S. Troelstra
From constructivism to computer science
R. Alur, L. Fix and T.A. Henzinger
Event-clock automata: a determinizable class of timed automata
M. Comini and M.C. Meo
Compositionality properties of SLD-derivations
J. Engelfriet and T. Gelsema
Multisets and structural congruence of the pi-calculus with replication
L. Aceto and J.F. Groote
A complete equational axiomatization for MPA with string iteration
R. Bloo and H. Geuvers
Explicit substitution. On the edge of strong normalization
Addendum
C. Berline and K. Grue
A «-denotational semantics for map theory in ZFC + SI
[Theoret. Comput. Sci. 179 (1997) 137-202]
Author index volume 211