Theoretical Computer Science 1999: Vol 227 Table of Contents PDF
Preview Theoretical Computer Science 1999: Vol 227 Table of Contents
Theoretical Computer Science Logic, semantics and theory of programming Volume 227, Numbers 1-2, 28 September 1999 Linear Logic | Guest Editors: J.-Y. Girard M. Okada A. Scedrov 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 fur Mathematik Contents Preface J.-Y. Girard, M. Okada and A. Scedrov Contributions S. Abramsky and G. McCusker Full abstraction for Idealized Algol with passive expressions G.M. Bierman A classical linear A-calculus 43 V. Danos and L. Regnier Reversible, irreversible and optimal A-machines 79 S. Guerrini A general theory of sharing graphs 99 H. Hu and A. Joyal Coherence completions of categories 153 N. Kobayashi, T. Shimizu and A. Yonezawa Distributed concurrent linear logic programming 185 F. Métayer Polynomial equivalence among systems LLNC, LLNC, and LLNC, 221 D.N. Turner and P. Wadler Operational interpretations of linear logic 231 J.-Y. Girard On denotational completeness J.-Y. Girard Coherent Banach spaces: a continuous denotational semantics P.D. Lincoln, J.C. Mitchell and A. Scedrov Optimization complexity of linear logic proof games M. Okada Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic Author index volume 227
The list of books you might like
