The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Stratified functional programs and computational complexity
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Information and Computation
Reversible, irreversible and optimal &lgr;-machines
Theoretical Computer Science - Special issue on linear logic, 1
Geometry of interaction 2: deadlock-free algorithms
COLOG '88 Proceedings of the International Conference on Computer Logic
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
Linear Ramified Higher Type Recursion and Parallel Complexity
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Operational Theories of Improvement in Functional Languages (Extended Abstract)
Proceedings of the 1991 Glasgow Workshop on Functional Programming
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Game semantics and abstract machines
LICS '96 Proceedings of the 11th 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
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion
Theoretical Computer Science - Implicit computational complexity
Slot games: a quantitative model of computation
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context Semantics, Linear Logic and Computational Complexity
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Elementary Complexity and Geometry of Interaction
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
An invariant cost model for the lambda calculus
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
A polytime functional language from light linear logic
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
Imposing linearity and ramification constraints allows to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polynomial-time computable functions, as the works by Leivant, Hofmann, and others show. This article shows that fine-tuning these two constraints leads to different expressive strengths, some of them lying well beyond polynomial time. This is done by introducing a new semantics, called algebraic context semantics. The framework stems from Gonthier's original work (itself a model of Girard's geometry of interaction) and turns out to be a versatile and powerful tool for the quantitative analysis of normalization in the lambda calculus with constants and higher-order recursion.