Theoretical Computer Science, Volume 227

Volume 227, Numbers 1-2, September 1999

• Samson Abramsky, Guy McCusker:
  Full Abstraction for Idealized Algol with Passive Expressions. 3-42
  
• Gavin M. Bierman:
  A Classical Linear lambda-Calculus. 43-78
  
• Vincent Danos, Laurent Regnier:
  Reversible, Irreversible and Optimal lambda-Machines. 79-97
  
• Stefano Guerrini:
  A General Theory of Sharing Graphs. 99-151
  
• Hongde Hu, André Joyal:
  Coherence Completions of Categories. 153-184
  
• Naoki Kobayashi, Toshihiro Shimizu, Akinori Yonezawa:
  Distributed Concurrent Linear Logic Programming. 185-220
  
• François Métayer:
  Polynomial Equivalence Among Systems LLNC, LLNC_a and LLNC₀. 221-229
  
• David N. Turner, Philip Wadler:
  Operational Interpretations of Linear Logic. 231-248
  
• Jean-Yves Girard:
  On Denotational Completeness. 249-273
  
• Jean-Yves Girard:
  Coherent Banach Spaces: A Continuous Denotational Semantics. 275-297
  
• Patrick Lincoln, John C. Mitchell, Andre Scedrov:
  Optimization Complexity of Linear Logic Proof Games. 299-331
  
• Mitsuhiro Okada:
  Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic. 333-396
  

Last update Sat May 18 17:40:22 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page