default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical 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, LLNCa and LLNC0. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-06 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
