An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof-nets and the Hilbert space
Proceedings of the workshop on Advances in linear logic
Optimality and inefficiency: what isn't a cost model of the lambda calculus?
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Information and Computation
Information and Computation
Reversible, irreversible and optimal &lgr;-machines
Theoretical Computer Science - Special issue on linear logic, 1
A general theory of sharing graphs
Theoretical Computer Science - Special issue on linear logic, 1
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
A parallel implementation for optimal lambda-calculus reduction
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Parallel beta reduction is not elementary recursive
Information and Computation
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Discreet Games, Light Affine Logic and PTIME Computation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Coherence for sharing proof-nets
Theoretical Computer Science - Linear logic
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
(Optimal) duplication is not elementary recursive
Information and Computation
Optimizing optimal reduction: A type inference algorithm for elementary affine logic
ACM Transactions on Computational Logic (TOCL)
Context Semantics, Linear Logic and Computational Complexity
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science
Elementary Complexity and Geometry of Interaction
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Principal Typing for Lambda Calculus in Elementary Affine Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Light types for polynomial time computation in lambda calculus
Information and Computation
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
| Hi-index | 0.00 |
Typing of lambda-terms in elementary and light affine logic (EAL and LAL, respectively) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, respectively) proof-nets admits a guaranteed polynomial (elementary, respectively) bound; on the other hand these terms can also be evaluated by optimal reduction using the abstract version of Lamping's algorithm. The first reduction is global while the second one is local and asynchronous. We prove that for LAL (EAL, respectively) typed terms, Lamping's abstract algorithm also admits a polynomial (elementary, respectively) bound. We also give a proof of its soundness and completeness (for EAL and LAL with type fixpoints), by using a simple geometry of interaction model (context semantics).