Abstract
We consider the functionals defined using an extension to higher types of ramified recurrence, which was introduced independently in [4,18,21] and [35]. Three styles of functional programs over free algebras are examined: equational recurrence, applicative programs with recurrence operators and purely applicative higher-type programs. We show that for every free algebra A and each one of these styles, the functions defined by ramified recurrence in finite types are precisely the functions over A computable in a number of steps elementary in the size of the input. This should be contrasted with unrestricted higher type recurrence which yields, for numeric computing, all provably recursive functions of first order arithmetic. This paper is revised and expanded from the proceedings paper [23]. The research project of which it is part is closely related to Rohit Parikh's longstanding interest in conceptual delineation of feasibility.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
