Showing papers by "Jean-Yves Girard published in 2004"

Linear logic in computer science

Abstract: Preface List of contributors Part I. Tutorials: 1. Category theory for linear logicians R. Blute and Ph. Scott 2. Proof nets and the x-calculus S. Guerrini 3. An overview of linear logic programming D. Miller 4. Linearity and nonlinearity in distributed computation G. Winskel Part II. Refereed Articles: 5. An axiomatic approach to structural rules for locative linear logic J. M. Andreoli 6. An introduction to uniformity in ludics C. Faggian, M. R. Fleury-Donnadieu and M. Quatrini 7. Slicing polarized addictive normalization O. Laurent and L. Toratora De Falco 8. A topological correctness criterion for muliplicative noncommutative logic P.A. Mellies Part III. Invited Articles: 9. Bicategories in algebra and linguistics J. Lambek 10. Between logic and quantic: a tract J. Y. Girard.

Linear Logic in Computer Science (London Mathematical Society Lecture Note Series)

Abstract: This paper presents an introduction to category theory with an emphasis on those aspects relevant to the analysis of the model theory of linear logic. With this in mind, we focus on the basic definitions of category theory and categorical logic. An analysis of cartesian and cartesian closed categories and their relation to intuitionistic logic is followed by a consideration of symmetric monoidal closed, linearly distributive and *-autonomous categories and their relation to multiplicative linear logic. We examine nonsymmetric monoidal categories, and consider them as models of noncommutative linear logic. We introduce traced monoidal categories, and discuss their relation to the geometry of interaction. The necessary aspects of the theory of monads is introduced in order to describe the categorical modelling of the exponentials. We conclude by briefly describing the notion of full completeness, a strong form of categorical completeness, which originated in the categorical model theory of linear logic. No knowledge of category theory is assumed, but we do assume knowledge of linear logic sequent calculus and the standard models of linear logic, and modest familiarity with typed lambda calculus. 1.0 Introduction Category theory arose as an organizing framework for expressing the maturality of certain constructions in algebraic topology. Its subsequent applicability, both as a language for simply expressing complex relationships between mathematical structures and as a mathematical theory in its own right, is remarkable. Categorical principles have been put to