Theoretical Computer Science, Volume 135

Volume 135, Number 1, 5 December 1994

Selected Papers of the Meeting on the Mathematical Foundations of Programming Semantics (MFPS'92), Oxford, April 1992
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

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, Marianna 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