Theoretical Computer Science 1999: Vol 227 Index

2 Pages·1999·0.34 MB·English

Theoretical
Computer Science
Theoretical Computer Science 227 (1999) 397
www.elsevier.com/locate/tcs
Author index volume 227 (1999)
(The issue number is given in front of the page numbers)
Abramsky, S. and G. McCusker, Full abstraction for Idealized Algol with passive
expressions (1-2) 3- 42
Bierman, G.M., A classical linear A-calculus (1-2) 43- 78
Danos, V. and L. Regnier, Reversible, irreversible and optimal /4-machines (1-2) 79- 97
Girard, J.-Y., M. Okada and A. Scedrov, Preface (1-2) 1
Girard, J.-Y., On denotational completeness (1-2) 249-273
Girard, J.-Y., Coherent Banach spaces: a continuous denotational semantics (1-2) 275-297
Guerrini, S., A general theory of sharing graphs (1-2) 99-151
Hu, H. and A. Joyal, Coherence completions of categories (1-2) 153-184
Joyal, A., see H. Hu (1-2) 153-184
Kobayashi, N., T. Shimizu and A. Yonezawa, Distributed concurrent linear logic pro-
gramming (1-2) 185-220
Lincoln, P.D., J.C. Mitchell and A. Scedrov, Optimization complexity of linear logic proof
games (1-2) 299-331
McCusker, G., see S. Abramsky (1-2) 3- 42
Metayer, F., Polynomial equivalence among systems LLNC, LLNC, and LLNC (1-2) 221-229
Mitchell, J.C., see P.D. Lincoln (1-2) 229-331
Okada, M., see J.-Y. Girard (1-2) 1
Okada, M., Phase semantic cut-elimination and normalization proofs of first- and
higher-order linear logic (1-2) 333-396
Regnier, L., see V. Danos (1-2) 79- 97
Scedrov, A., see P.D. Lincoln (1-2) 229-331
Shimizu, T., see N. Kobayashi (1-2) 185-220
Scedrov, A., see J.-Y. Girard (1-2) 1
Turner, D.N. and P. Wadler, Operational interpretations of linear logic (1-2) 231-248
Wadler, P., see D.N. Turner (1-2) 231-248
Yonezawa, A., see N. Kobayashi (1-2) 185-220
Elsevier Science B.V.