Applicative control and computational complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1683, Issue , 1999, Pages 82-95

  Leivant, Daniel ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CALCULATIONS; COMPUTATIONAL COMPLEXITY; DIFFERENTIATION (CALCULUS); SYNTACTICS;

COMPLEXITY CLASS; ELEMENTARY FUNCTION; HIGHER-ORDER; SIMPLY TYPED LAMBDA CALCULUS; SPACE FUNCTIONS; SYNTACTIC CONTROL; TIME FUNCTION;

COMPUTER CIRCUITS;

EID: 84956852827     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_7     Document Type: Conference Paper

References (23)

1. Arnold Beckmann and Andreas Weiermann. Characterizing the elementary recursive functions by a fragment of Gödel's T. Manuscript, www.math.uni-muenster.de/math/inst/logik/publ/pap/20.html.
2. 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.
3. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97-110, 1992.
4. S. Bloch. Functional characterizations of uniform log-depth and polylog-depth circuit families. In Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pages 193-206. IEEE Computer Society Press, 1992.
5. 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.
6. W.G. Handley. Bellantoni and Cook's characterization of polynomial time functions. Typescript, August 1992.
7. Martin Hofmann. Type systems for polynomial-time computation. Habili-tationsschrift, 1998.
8. N. Jones. Computability and Complexity from a Programming Perspective. MIT Press, Cambridge, MA, 1997.
9. 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.
10. D. Leivant. Stratified functional programs and computational complexity. In Conference Record ofthe Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 325-333, New York, 1993. ACM.
11. D. Leivant. A foundational delineation of poly-time. Information and Computation, 1994. (Special issue of selected papers from LICS'91, edited by G. Kahn).
12. 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. Birkhauser-Boston, New York, 1994.
13. 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.
14. 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.
15. 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.
16. D. Leivant and J.-Y. Marion. Lambda-calculus characterizations of poly-time. Fundamenta Informaticae, 19:167-184, 1993. Special Issue: Lambda Calculus and Type Theory (editor: J. Tiuryn).
17. 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.
18. D. Leivant and J.-Y. Marion. Ramified recurrence and computational complexity IV: Predicative functionals and poly-space. Information and Computation, 1999.
19. 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.
20. 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.
21. K.-H. Niggl,S. Bellantoni and H. Schwichtenberg. Higher type ramification and polynomial time. manuscript, to appear, 1999.
22. Kurt Schütte. Proof Theory. Springer-Verlag, 1977.
23. H. Simmons. The realm of primitive recursion. Archive for Mathematical Logic, 27:177-188, 1988.