Book ChapterDOI
Light Linear Logic
Jean-Yves Girard
- pp 145-176
About:
This article is published in Logical and Computational Complexity.The article was published on 1994-10-13. It has received 108 citations till now. The article focuses on the topics: Substructural logic & Logic optimization.read more
Citations
More filters
Book ChapterDOI
Linear logic: its syntax and semantics
TL;DR: The first objection to that view is that there are in mathematics, in real life, cases where reaction does not exist or can be neglected : think of a lemma which is forever true, or of a Mr. Soros, who has almost an infinite amount of dollars.
Book
The Blind Spot: Lectures on Logic
TL;DR: In this paper, a course on logic by one of the world's leading proof theorists challenges mathematicians, computer scientists, physicists and philosophers to rethink their views and concepts on the nature of mathematical knowledge in an exceptionally profound way.
Book ChapterDOI
Elementary Complexity and Geometry of Interaction
Patrick Baillot,Marco Pedicini +1 more
TL;DR: A geometry of interaction model given by an algebra of clauses equipped with resolution into which proofs of Elementary Linear Logic can be interpreted is introduced.
Book ChapterDOI
From proofs to focused proofs: a modular proof of focalization in linear logic
Dale Miller,Alexis Saurin +1 more
TL;DR: A new proof of the completeness of focused proofs in terms of proof transformation is given, first proved for MALL and then extended to full linear logic, and it is shown how the proof can be extended to larger systems, such as logics with induction.
Journal ArticleDOI
A semantic measure of the execution time in linear logic
TL;DR: A semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net and proves that a net is head-normalizable if and only if its exhaustive interpretation (a suitable restriction of its interpretation) is not empty.
References
More filters
Journal ArticleDOI
Bounded linear logic: a modular approach to polynomial-time computability
TL;DR: It is proved that any functional term of appropriate type actually encodes a polynomial-time algorithm and that conversely any polynometric-time function can be obtained in this way.
Book ChapterDOI
Lambda calculus characterizations of poly-time
Daniel Leivant,Jean-Yves Marion +1 more
TL;DR: The authors consider typed λ-calculi with pairing over the algebra W of words over {0, 1}, with a destructor and discriminator function, and show that the poly-time functions are precisely the functions (1) λrepresentable using simple types, with abstract input (represented by Church-like terms) and concrete output (representing by algebra terms), but with the input and output representations differing slightly.
Journal ArticleDOI
Lambda calculus characterizations of poly-time
Daniel Leivant,Jean-Yves Marion +1 more
TL;DR: This work considers typed λ-calculi with pairing over the algebra W of words over {0,1}, with a destructor and discriminator function, and shows that the poly-time functions are precisely the functionsλ-representable using simple types, with abstract input and output.