Theoretical Computer Science
Linear logic: its syntax and semantics
Proceedings of the workshop on Advances in linear logic
Information and Computation
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Elementary Complexity and Geometry of Interaction
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Linear logic and elementary time
Information and Computation - Special issue: ICC '99
Linear logic and polynomial time
Mathematical Structures in Computer Science
Elementary Complexity and Geometry of Interaction
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Multiplexor Categories and Models of Soft Linear Logic
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Light types for polynomial time computation in lambda calculus
Information and Computation
Linear logic by levels and bounded time complexity
Theoretical Computer Science
Intersection Types for Light Affine Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A semantic measure of the execution time in linear logic
Theoretical Computer Science
Elementary Complexity and Geometry of Interaction
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
| Hi-index | 0.00 |
Light linear logic (LLL) was introduced by Girard as a logical system capturing the class of polytime functions within the proofs-as-programs approach. In the present paper, we undertake a semantical analysis of LLL: a variant of coherence spaces is introduced and we prove that it is a sound model for this system, but not for usual linear logic. A simpler version of the model yields a sound semantics of Elementary linear logic, which is the analog of LLL for the class of Kalmar elementary functions. We illustrate our semantical method by showing how various principles fail in these models.