Polymorphic type inference and containment
Information and Computation - Semantics of Data Types
Proofs and types
Lambda calculus characterizations of poly-time
Fundamenta Informaticae - Special issue: lambda calculus and type theory
A foundational delineation of poly-time
Papers presented at the IEEE symposium on Logic in computer science
Information and Computation
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Phase semantics and decidability of elementary affine logic
Theoretical Computer Science - Logic, semantics and theory of programming
(Optimal) duplication is not elementary recursive
Information and Computation
An elementary fragment of second-order lambda calculus
ACM Transactions on Computational Logic (TOCL)
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science
Linear logic and polynomial time
Mathematical Structures in Computer Science
The intensional content of Rice's theorem
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Light types for polynomial time computation in lambda calculus
Information and Computation
Light Linear Logic with Controlled Weakening
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Context semantics, linear logic, and computational complexity
ACM Transactions on Computational Logic (TOCL)
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets
Types for Proofs and Programs
Bounded Linear Logic, Revisited
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Quantum implicit computational complexity
Theoretical Computer Science
Linear logic by levels and bounded time complexity
Theoretical Computer Science
Theoretical Computer Science
Nondeterministic light logics and NP-time
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
From proof-nets to linear logic type systems for polynomial time computing
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
A semantic proof of polytime soundness of light affine logic
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A local criterion for polynomial-time stratified computations
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Light logics and optimal reduction: Completeness and complexity
Information and Computation
Realizability models and implicit complexity
Theoretical Computer Science
Linearity and recursion in a typed Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Controlling program extraction in light logics
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
An elementary affine λ-calculus with multithreading and side effects
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Verification of ptime reducibility for system f terms via dual light affine logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Quantitative models and implicit complexity
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A feasible algorithm for typing in elementary affine logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Elementary affine logic and the call-by-value lambda calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
An Implicit Characterization of PSPACE
ACM Transactions on Computational Logic (TOCL)
Elementary linear logic revisited for polynomial time and an exponential time hierarchy
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Typing a core binary-field arithmetic in a light logic
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
Rewriting Computation and Proof
A soft type assignment system for &lambda-calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
This article is a structured introduction to Intuitionistic Light Affine Logic (ILAL). ILAL has a polynomially costing normalization, and it is expressive enough to encode, and simulate, all PolyTime Turing machines. The bound on the normalization cost is proved by introducing the proof-nets for ILAL. The bound follows from a suitable normalization strategy that exploits structural properties of the proof-nets. This allows us to have a good understanding of the meaning of the § modality, which is a peculiarity of light logics. The expressive power of ILAL is demonstrated in full detail. Such a proof gives a hint of the nontrivial task of programming with resource limitations, using ILAL derivations as programs.