Abstract
We establish a tight correspondence between three major complexity classes and simple syntactic restrictions on applicative programs in the simply typed lambda calculus with a recurrence operator. The syntactic restrictions considered are: recurrence arguments cannot be passed as computed values (“input-driven terms”), abstracted higher-order variables can appear at most once (“solitary terms”), and abstracted variables cannot be eventually nested (“separated terms”).
We show that the functions over word algebras represented by inputdriven terms are precisely the poly-time functions (a result akin to [8] (Chapter 24.2)). When input-driven recurrence is permitted over all finite types, the elementary functions are obtained (a result akin to [1]). When terms are further restricted to solitary ones, even recurrence in all finite type yields only the poly-time functions. Finally, separated terms generate exactly the poly-space functions.
The interest in the approach discussed here lies in its simplicity: the complexity characterizations are based on restricted use of standard applicative constructs, rather than a syntactic overlay as in ramified recurrence [3], [12], [15], [7], [21]. However, approaches based on ramified recurrence are more powerful than simple syntactic control, as well as more conceptually and methodologically coherent. Thus, the two approaches are complementary and of independent interest.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnold Beckmann and Andreas Weiermann. Characterizing the elementary recursive functions by a fragment of Gödel’s T. Manuscript, www.math.unimuenster http://www.math.unimuenster.de/math/inst/logik/publ/pap/20.html.
S. Bellantoni. Predicative recursion and the polytime hierarchy. In Peter Clote and Jeffery Remmel, editors, Feasible Mathematics II, Perspectives in Computer Science, pages 15–29. Birkhäuser, 1994.
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97–110, 1992.
S. Bloch. Functional characterizations of uniform log-depth and polylogdepth circuit families. In Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pages 193–206. IEEE Computer Society Press, 1992.
A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pages 24–30. North-Holland, Amsterdam, 1962.
W.G. Handley. Bellantoni and Cook’s characterization of polynomial time functions. Typescript, August 1992.
Martin Hofmann. Type systems for polynomial-time computation. Habilitationsschrift, 1998.
N. Jones. Computability and Complexity from a Programming Perspective. MIT Press, Cambridge, MA, 1997.
D. Leivant. Subrecursion and lambda representation over free algebras. In Samuel Buss and Philip Scott, editors, Feasible Mathematics, Perspectives in Computer Science, pages 281–291. Birkhauser-Boston, New York, 1990.
D. Leivant. Stratified functional programs and computational complexity. In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 325–333, New York, 1993. ACM.
D. Leivant. A foundational delineation of poly-time. Information and Computation, 1994. (Special issue of selected papers from LICS’91, edited by G. Kahn).
D. Leivant. Ramified recurrence and computational complexity I: Word recurrence and poly-time. In Peter Clote and Jeffrey Remmel, editors, Feasible Mathematics II, pages 320–343. Birkhäuser-Boston, New York, 1994.
D. Leivant. Intrinsic theories and computational complexity. In D. Leivant, editor, Logic and Coputational Complexity, volume 960 of LNCS, pages 177–194. Springer-Verlag, Berlin, 1995.
D. Leivant. A characterization of NC by tree recurrence. In Thirty Ninth Annual Symposium on Foundations of Computer Science (FOCS), pages 716–724, Los Alamitos, CA, 1998. IEEE Computer Society.
D. Leivant. Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity. Annals of Pure and Applied Logic, 1998. Special issue in honor of Rohit Parikh’s 60th Birthday; editors: M. Fitting, R. Ramanujam and K. Georgatos.
D. Leivant and J.-Y. Marion. Lambda-calculus characterizations of polytime. Fundamenta Informaticae, 19:167–184, 1993. Special Issue: Lambda Calculus and Type Theory (editor: J. Tiuryn).
D. Leivant and J.-Y. Marion. Ramified recurrence and computational complexity II: substitution and poly-space. In L. Pacholski and J. Tiuryn, editors, Proceedings of CSL 94, pages 486–500. LNCS 933, Springer Verlag, 1995.
D. Leivant and J.-Y. Marion. Ramified recurrence and computational complexity IV: Predicative functionals and poly-space. Information and Computation, 1999.
D. Leivant and J.-Y. Marion. Ramified recurrence and computational complexity V: linear tree recurrence and alternating log-time. Theoretical Computer Science, 1999. Special issue for CAAP’98, editor: M. Duachet.
J. Mitchell, M. Mithcell, and A. Scedrov. A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In Thirty Ninth Annual Symposium on Foundations of Computer Science (FOCS), pages 725–733, Los Alamitos, CA, 1998. IEEE Computer Society.
K.-H. Niggl S. Bellantoni and H. Schwichtenberg. Higher type ramification and polynomial time. manuscript, to appear, 1999.
Kurt Schütte. Proof Theory. Springer-Verlag, 1977.
H. Simmons. The realm of primitive recursion. Archive for Mathematical Logic, 27:177–188, 1988.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leivant, D. (1999). Applicative Control and Computational Complexity. In: Flum, J., Rodriguez-Artalejo, M. (eds) Computer Science Logic. CSL 1999. Lecture Notes in Computer Science, vol 1683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48168-0_7
Download citation
DOI: https://doi.org/10.1007/3-540-48168-0_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66536-6
Online ISBN: 978-3-540-48168-3
eBook Packages: Springer Book Archive