default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinear Logic Tokyo Meeting 1996: Tokyo, Japan
- Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov:
Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29 - April 2, 1996. Electronic Notes in Theoretical Computer Science 3, Elsevier 1996 - Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
:
Preface. 1 - Samson Abramsky, Guy McCusker:
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. 2-14 - Gavin M. Bierman:
Towards a Classical Linear lambda-calculus. 15-27 - Richard Blute, Philip J. Scott:
A Noncommutative Full Completeness Theorem. 28-38 - Dirk van Dalen:
Intuitionism - Counting its Blessings. 39 - Vincent Danos, Laurent Regnier:
Reversible, Irreversible and Optimal Lambda-machines. 40-60 - Christophe Fouqueré, Jacqueline Vauzeilles:
Linear Logic for Taxonomical Networks and Database Updates. 61-74 - Jean-Yves Girard:
On denotational completeness. 75-80 - Jean-Yves Girard:
Coherent Banach Spaces: a continuous denotational semantics. 81-87 - Susumu Hayashi, Masakazu Ishikawa, Satoshi Kobayashi, Hiroshi Nakano, Syuichi Nakazaki:
Two Extensions of PX system. 88 - Kohei Honda:
Abstract Process Structures. 89-105 - Max I. Kanovich:
Simulating Computations in Second Order Non-Commutative Linear Logic. 106 - François Lamarche:
From Proof Nets to Games. 107-119 - Patrick Lincoln, John C. Mitchell, Andre Scedrov:
The Complexity of Local Proof Search in Linear Logic. 120-129 - François Métayer:
Some remarks on cyclic linear logic. 130-137 - Raymond McDowell, Dale Miller, Catuscia Palamidessi:
Encoding Transition Systems in Sequent Calculus. 138-152 - Misao Nagayama, Mitsuhiro Okada:
A Graph-Theoretic Characterization Theorem for Multiplicative Fragment of Non-Commutative Linear Logic. 153 - Mitsuhiro Okada:
Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs. 154 - Vaughan R. Pratt:
Broadening the denotational semantics of linear logic. 155-166 - Christian Retoré:
Perfect matchings and series-parallel graphs: multiplicatives proof nets as R&B-graphs. 167-182 - Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx:
Computational isomorphisms in classical logic. 183-195 - Joshua S. Hodas, Jeffrey Polakow:
Forum as a Logic Programming Language. 196-207 - Marco Pedicini:
Remarks on Elementary Linear Logic. 208-219 - Lorenzo Tortora de Falco:
Generalized standardization lemma for the additives. 220-232
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 2026-01-30 23:00 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:
