Abstract
We formulate a notion of predicative function types, and define predicative recurrence over functions, both in equational style and as an applicative formalism, pointing out the equivalence between the two approaches. We then show that a function is poly-space iff it is defined using predicative functionals obtained by ramified recurrence over words.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Bellantoni. Predicative Recursion and Computational Complexity. PhD thesis, University of Toronto, 1992.
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 polylog-depth 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, 1965.
K. Gödel. über eine bisher noch nicht benüte Erweiterung des finiten Standpunktes. Dialectica, 12:280–287, 1958. Republished with English translation and explanatory notes by A. S. Troelstra in Kurt Gödel: Collected Works, Vol. II. S. Feferman, ed. Oxford University Press, 1990.
W.G. Handley. Bellantoni and Cook's characterization of polynomial time functions. Typescript, August 1992.
J.van Heijenoort. From Frege to Gödel, A Source Book in Mathematical Logic, 879–1931. Harvard University Press, Cambridge, MA, 1967.
D. Hilbert. über das unendliche. Mathematische Annalen, 95:161–190, 1925. English translation in [8], pages 367–392.
B.M. Kapron and S.A. Cook. A new characterization of mehlhorn's polynomial time functionals. SIAM Journal of Computing, 25(1):117–132, Feb. 1996.
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. Predicative recurrence in finite type. In A. Nerode and Yu.V. Matiyasevich, editors, Logical Foundations of Computer Science, LNCS 813, pages 227–239, Berlin, 1994. Springer-Verlag. Proceedings of the Third LFCS Symposium, St. Petersburg.
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.
D. Leivant. Intrinsic theories and computational complexity. In D. Leivant, editor, Logic and Computational Complexity, number 960 in LNCS, pages 177–194. Springer-Verlag, 1995.
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.
E. Nelson. Predicative Arithmetic. Princeton University Press, Princeton, 1986.
A. P. Nguyen. A formal system for linear space reasoning. PhD thesis, University of Toronto, 1993. Master of Science Thesis.
H.E. Rose. Subrecursion. Clarendon Press (Oxford University Press), Oxford, 1984.
H. Simmons. The realm of primitive recursion. Archive for Mathematical Logic, 27:177–188, 1988.
J.V. Tucker and J.I. Zucker. Program Correctness over Abstract Data Types, with Error-State Semantics. CWI Monographs No. 6. North-Holland and the Centre for Mathematics and Computer Science, Amsterdam, 1988.
K.N. Venkataraman, A. Yasuhara, and F. M. Hawrusik. A view of computability on term algebras. Journal of Computer and System Sciences, 26(2):410–471, June 1983.
H. Wang. Some formal details on predicative set theories, chapter XXIV. Science Press, Peking, 1962. Republished in 1964 by North Holland, Amsterdam. Republished in 1970 under the title Logic, Computers, and Sets by Chelsea, New York.
A. N. Whitehead and B. Russell. Principia Mathematicae. Cambridge University Press, second edition, 1929.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leivant, D., Marion, JY. (1997). Predicative functional recurrence and poly-space. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030611
Download citation
DOI: https://doi.org/10.1007/BFb0030611
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive