Stratified functional programs and computational complexity
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Predictive recursion and computational complexity
Predictive recursion and computational complexity
Lambda calculus characterizations of poly-time
Fundamenta Informaticae - Special issue: lambda calculus and type theory
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
A foundational delineation of poly-time
Papers presented at the IEEE symposium on Logic in computer science
Function-algebraic characterizations of log and polylog parallel time
Computational Complexity
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
SIAM Journal on Computing
Predicative Recurrence in Finite Types
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
A Safe Recursion Scheme for Exponential Time
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
Programming languages capturing complexity classes
Nordic Journal of Computing
On the expressive power of the loop language
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A flow calculus of mwp-bounds for complexity analysis
ACM Transactions on Computational Logic (TOCL)
The small grzegorczyk classes and the typed λ-calculus
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The flow of data and the complexity of algorithms
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
A short introduction to implicit computational complexity
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
| Hi-index | 0.00 |
Two restricted imperative programming languages are considered: One is a slight modification of a loop language studied intensively in the literature, the other is a stack programming language over an arbitrary but fixed alphabet, supporting a suitable loop concept over stacks. The paper presents a purely syntactical method for analysing the impact of nesting loops on the running time. This gives rise to a uniform measure µ on both loop and stack programs, that is, a function that assigns to each such program P a natural number µ(P) computable from the syntax of P.It is shown that stack programs of µ-measure n compute exactly those functions computed by a Turing machine whose running time lies in Grzegorczyk class εn-2. In particular, stack programs of µ-measure 0 compute precisely the polynomial-time computable functions.Furthermore, it is shown that loop programs of µ-measure n compute exactly the functions in εn-2. In particular, loop programs of µ-measure 0 compute precisely the linear-space computable functions.