Linear logic
Jean-Yves Girard
- Vol. 50, Iss: 1, pp 1
Reads0
Chats0
About:
The article was published on 1987-01-30 and is currently open access. It has received 3947 citations till now. The article focuses on the topics: Affine logic & Substructural logic.read more
Citations
More filters
Workshop on Database Programming Languages
François Bancilhon,Peter Buneman +1 more
TL;DR: These are the revised proceedings of the Workshop on Database Programming Languages held at Roscoff, Finistère, France in September of 1987, which brought together researchers from both databases and programming languages to discuss recent developments in the two areas in the hope of overcoming some of the obstacles that appear to prevent the construction of a uniform database programming environment.
Book ChapterDOI
Computability Logic: a formal theory of interaction
TL;DR: The present chapter contains a comprehensive yet relatively compact overview of this very recently introduced framework and research program, computability logic, written in a semitutorial style with general computer science, logic and mathematics audiences in mind.
Book ChapterDOI
Relevant and Substructural Logics
TL;DR: The chapter discusses how relevant logics are naturally counted as substructural logics, as certain commonly admitted structural rules are responsible for introducing irrelevant consequences into proofs.
Journal ArticleDOI
Genericity and the π-calculus
TL;DR: A second-order polymorphic π-calculus based on duality principles is introduced, building on type structures coming from typed ρ-calculi, Linear Logic and game semantics, and the proof combines process-theoretic reasoning with techniques from game semantics.
Journal ArticleDOI
Linear logic by levels and bounded time complexity
Patrick Baillot,Damiano Mazza +1 more
TL;DR: It turns out that Girard's systems can be recovered by forcing depth and level to coincide, and this fact is used to propose a variant of the polytime system in which the paragraph modality is only allowed on atoms, and which may serve as a basis for developing lambda-calculus type assignment systems with more efficient typing algorithms than existing ones.