Abstract
Recursive functions are functions whose values can be effectively computed, hence they are the most interesting part, from a pragmatical point of view, of the definable functions on natural integers.
This is a preview of subscription content, log in via an institution to check access.
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
C. Böhm and A. Berarducci “Automatic Synthesis of Typed Lambda-programs on Term Algebras”, “Theoretical Computer Science 39”, p. 135–154, 1985.
D. Leivant and J-Y. Marion “Lambda characterization of poly-time”, in J. Tyurin, ed. “Fundamenta Informaticae”, Special issue in Typed Lambda Calculi, 1993.
S. Bellantoni and S. Cook “A new recursion-theoretic characterization of the polytime functions”, in “24th Annual ACM STOC” (1992), 283–293.
M. Hoffman, “A mixed modal/linear Lambda calculus with application to Bellantoni-Cook safe recursion”, in Proceedings of CSL ‘87, Aarhus, Springer, LNCS, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Böhm, C. (1999). Imposing Polynomial Time Complexity in Functional Programming. In: Carsetti, A. (eds) Functional Models of Cognition. Theory and Decision Library, vol 27. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9620-6_8
Download citation
DOI: https://doi.org/10.1007/978-94-015-9620-6_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5360-2
Online ISBN: 978-94-015-9620-6
eBook Packages: Springer Book Archive