Higher type recursion, ramification and polynomial time

It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a ramified type structure, and by adding linear concepts to the lambda calculus.

• Type: Journal
• Year: 2000
• Where: APAL
• Authors: Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg
• Keywords: APAL 2000, Finite Types, Ramified Type Structure, Time Computable Functions