default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 135
Volume 135, Number 1, 5 December 1994
Part I: Linear Logic
- Samson Abramsky
:
Proofs as Processes. 5-9 - Gianluigi Bellin, Philip J. Scott:
On the pi-Calculus and Linear Logic. 11-65 - Didier Galmiche, Guy Perrier:
On Proof Normalization in Linear Logic. 67-110 - Gianfranco Mascari, Marco Pedicini:
Head Linear Reduction and Pure Proof Net Extraction. 111-137 - Patrick Lincoln, Andre Scedrov:
First-Order Linear Logic without Modalities is NEXPTIME-Hard. 139-153 - Patrick Lincoln, Timothy C. Winkler:
Constant-Only Multiplicative Linear Logic is NP-Complete. 155-169
Volume 135, Number 2, 12 December 1994
- Christel Baier, Mila E. Majster-Cederbaum:
Denotational Semantics in the CPO and Metric Approach. 171-220 - Hartmut Ehrig, Martin Große-Rhode:
Functorial Theory of Parameterized Specifications in a General Specification Framework. 221-266 - Alexey L. Lastovetsky, Sergey S. Gaissaryan:
An Algebraic Approach to Semantics of Programming Languages. 267-288 - Felipe Bracho, Manfred Droste:
Labelled Domains and Automata with Concurrency. 289-318 - Pascal Manoury, Marianne Simonot:
Automatizing Termination Proofs of Recursively Defined Functions. 319-343 - Elizabeth A. Scott:
Weights for Total Division Orderings on Strings. 345-359 - Kunihiko Hiraishi:
Some Complexity Results on Transition Systems and Elementary Net Systems. 361-376 - Jianan Li, Ichiro Suzuki, Masafumi Yamashita:
Fair Petri Nets and Structural Induction for Rings of Processes. 377-404 - P. Trigg, J. Roger Hindley, Martin W. Bunder:
Combinatory Abstraction Bsing B, B' and Friends. 405-422 - René David:
The Inf Function in the System F. 423-431
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 2025-12-05 22:23 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:
