Science of Computer Programming North-Holland
10 (1988) 339
339
AUTHOR INDEX* Volume 10 (1988)
Baruch, 0. and Katz, SK, Partially interpreted schemas for CSP programming Broy, M., Nondeterministic data flow programs: How to avoid the merge anomaly Harrison, P-G., Linearisation: An optimisation for nonlinear functional programs Kapur, D. and Srivas, M., Computability and implementability issues in abstract data c types Katz, Sh., see Bar&t, 0. Kruseman Aretz, F.EJ., On deriving a LISP program from its specification Mason, I.A., Verification of programs that destructively manipulate data Michel, B., A ‘division’ transformation for program and data structures and the structure clash problem Nielson, F., see Nielson, H.R. Nielson, H.R. and Nielson, F., Automatic binding time analysis for a typed h-calculus Prywes, N.S., see Szymanski, B.K. Rem, M., Small programming exercises 20 Rem, M., Small programming exercises 21 Srivas, M., see Kapur, D. Szymanski, B.K. and Prywes, N.S., Efficient handling of data structures in definitional languages Tan, B.&see Tel, G. Tel, G., Tan, R.B. and Van Leeuwen, J., The derivation of graph marking algorithms from distributed termination detection protocols Van Leeuwen, J., see Tel, G.
* The issue number is given in front of the page numbers. 0167~6423/88/$3.50 @ 1988, Elsevier Science Publishers B.V. (North-Holland)
(1) 1- 18 (1) 65- 85 (3) 281-318 (1) 33- 63 (1) I- 18 (1) 19- 32 (2) 177-210 (3) (2) (2) (3) (1) (3) (1)
247-280 139-176 139-176 221-245 99-10s 319-325 33- 63
(3) 221-245 (2) 107-137 (2) 107-137 (2) 107-137