Showing papers by "Jean-Yves Girard published in 1991"
TL;DR: This work follows the order of discovery of the concepts, which (as expected) starts with the semantics and ends with the syntex; it is hoped that this orthogonal look at the same object will help to apprehend the concepts.
Abstract: There are two ways to present this work; the most efficient is of course to start with the main syntactical definitions, and to end with semantics: this is the presentation that we follow in the body of the text: section 1, syntex; section 2, semantics. Another possibility is to follow the order of discovery of the concepts, which (as expected) starts with the semantics and ends with the syntex; we adopt this second way for our introduction, hoping that this orthogonal look at the same object will help to apprehend the concepts.
350 citations
[...]
01 Jan 1991
TL;DR: A typed, modular paradigm for polynomial time computation is proposed and Bounded Linear Logic: A Modular Approach to Polynomial Time Computability is proposed.
Abstract: A typed, modular paradigm for polynomial time computation is proposed. Comments University of Pennsylvania Department of Computer and Information Sciences Technical Report No. MSCIS-91-59. This technical report is available at ScholarlyCommons: https://repository.upenn.edu/cis_reports/338 Bounded Linear Logic: A Modular Approach to Polynomial Time Computability MS-CIS-91-59 LOGIC & COMPUTATION 36 Jean-Yves Girard Andre Scedrov Philip J. Scott Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 19104-6389
50 citations