Table Of Content

Theoretical Computer Science 90 (1991) 457-458 Elsevier Author Index Volume 90 (1991) (The issue number is given in front of the page numbers) Barzdin, J.M. and G.J. Barzdin, Rapid constructions of algebraic axioms from samples (1) 199-208 Barzdin, G.J., see J.M. Barzdin (1) 199-208 Bjgrner, D., Preface to the Special Issue “Images of Programming—Dedicated to the Memory of Andrei P. Ershov” (1) Xi Blikle, A., A. Tarlecki and M. Thorup, On conservative extensions of syntax in system development (1) 209-233 Bulyonkov, M. A., From partial evaluation to computation (1) 47- 60 Cherkasova, L.A. and V.E. Kotov, An algebra of concurrent non-deterministic processes (1) 151-170 De Bakker, J.W. and J.H.A. Warmerdam, Four domains for concurrency (1) 127-149 Dong, G. and S. Ginsburg, Localizable constraints for object histories (2) 391-432 Futamura, Y., K. Nogi and A. Takano, Essence of generalized partial computation (1) 61- 79 Ginsburg, S., see G. Dong (2) 391-432 Hoare, C.A.R., A theory for the derivation of combinational C-mos circuit designs (1) 235-251 Itkin, V.E., An algebra of mixed computation (1) 81- 93 Jones, N.D., Static semantics, types, and binding time analysis (1) 95-118 Kasyanov, V, Transformational approach to program concretization (1) 37- 46 Knuth, D.E., Theory and practice (1) 1- 15 Kotov, V.E., see L.A. Cherkasova (1) 151-170 Mazurkiewicz, A., A. Rabinovich and B.A. Trakhtenbrot, Connectedness and synchronization (1) 171-184 Nepejvoda, N.N., A bridge between constructive logic and computer programming (1) 253-270 Nogi, K., see Y. Futamura (1) 61- 79 Pottosin, I.V., Analysis of program optimization possibilities and further development (1) 17- 36 Rabinovich, A., see A. Mazurkiewicz (1) 171-184 Rus, T., Algebraic construction of compilers (Fundamental Study) (2) 271-308 Saito, T., Dynamics of equivalence relations in automata networks (2) 355-367 Takano, A., see Y. Futamura (1) 61- 79 Tarlecki, A., see A. Blikle (1) 209-233 Tatsuta, M., Program synthesis using realizability (Fundamental Study) (2) 309-353 Thorup, M., see A. Blikle (1) 209-233 Toyama, Y., How to prove equivalence of term rewriting systems without induction (2) 369-390 Trakhtenbrot, B.A., see A. Mazurkiewicz (1) 171-184 Turski, W.M., Prescribing behaviours (1) 119-125 Tyugu, E., Higher order dataflow schemas (1) 185-198 Vakarelov, D., Modal logics for knowledge representation systems (2) 433-456 Warmerdam, J.H.A., see J.W. De Bakker (1) 127-149