Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0168-0072(00)00006-3 | Annals of Pure and Applied Logic |
Keywords | Field | DocType |
03D15,03D20,68Q15,68Q42,68N15,03F03,03F10,03F35 | Discrete mathematics,Lambda calculus,Typed lambda calculus,Simply typed lambda calculus,Corecursion,Fixed-point combinator,Double recursion,Computable function,Mathematics,Recursion | Journal |
Volume | Issue | ISSN |
104 | 1-3 | 0168-0072 |
Citations | PageRank | References |
39 | 1.98 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephen J. Bellantoni | 1 | 58 | 4.35 |
| Karl-Heinz Niggl | 2 | 111 | 9.71 |
| Helmut Schwichtenberg | 3 | 373 | 44.83 |