Accession Number:

ADA289484

Title:

Theoretical Computer Science. Logic Semantics and Theory of Programming. Volume 135, Number 1, December 5, 1994,

Descriptive Note:

Corporate Author:

TULANE UNIV NEW ORLEANS LA DEPT OF MATHEMATICS

Personal Author(s):

• Mislove, M. W.
• Nivat, M.
• Reed, G. M.
• Roscoe, A. W.
• Wachter, R. F.

Report Date:

1994-12-05

Pagination or Media Count:

178.0

Abstract:

CONTENTS MW. Mislove, G.M. Reed, A. W Roscoe and R. F. Wachter Foreword S. Abramsky Preface Abramsky Proofs as processes G. Bellin and P.j Scott On the it-calculus and linear logic D. Galmiche and G. Perrier On proof normalization in linear logic G. F. Mascari and M. Pedicini Head linear reduction and pure proof net extraction P. Lincoln and A. Scedrov First-order linear logic without modalities in NEXPTlME-hard P. Lincoln and T Winkler Constant-only multiplicative linear logic is NP-complete. P. 10

Descriptors:

• *COMPUTER LOGIC
• *COMPUTER PROGRAMMING
• *SEMANTICS
• COMPUTERS
• THEORY
• PERIODICALS

Subject Categories:

• Linguistics
• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE