{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:10:51Z","timestamp":1761610251418,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3831,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1571-0661(04)80495-x","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"149-162","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Feasible functionals and intersection of ramified types"],"prefix":"10.1016","volume":"70","author":[{"given":"Daniel","family":"Leivant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the poly-time functions, 1992.","DOI":"10.1145\/129712.129740"},{"year":"1986","series-title":"Bounded Arithmetic","author":"Buss","key":"10.1016\/S1571-0661(04)80495-X_NEWBIB2"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB3","series-title":"Structure in Complexity, LNCS 233","first-page":"77","article-title":"The polynomial hierarchy and intuitionistic bounded arithmetic","author":"Buss","year":"1986"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB4","series-title":"Computer Science Logic, LNCS 1092","first-page":"145","article-title":"A note on the relation between polynomial time functionals and constable's class k","author":"Clote","year":"1996"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB5","unstructured":"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\u201330. North-Holland, Amsterdam, 1962."},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Robert Constable. Type 2 computational complexity. In Fifth Annual ACM Symposium on Theory of Computing, pages 108\u2013121, New York, 1973. ACM.","DOI":"10.1145\/800125.804041"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB7","series-title":"Logic from Computer Science","first-page":"51","article-title":"Computability and complexity of higher type functions","author":"Cook","year":"1991"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Stephen A. Cook and Alasdair Urquhart. Functional interpretations of feasible constructive arithemtic (extended abstract). In Proceedings of the 21st ACM Symposium on Theory of Computing, pages 107\u2013112, 1989.","DOI":"10.1145\/73007.73017"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0168-0072(93)90044-E","article-title":"Functional interpretations of feasible constructive arithemtic","volume":"63","author":"Stephen Cook","year":"1993","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB10","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1111\/j.1746-8361.1958.tb01464.x","article-title":"\u00dcber eine bisher noch nicht benutzte erweiterung des finiten standpunktes","volume":"12","author":"G\u00f6del","year":"1958","journal-title":"Dialectica"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB11","series-title":"Rozprawy Mate. IV","article-title":"Some classes of recursive functions","author":"Grzegorczyk","year":"1953"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1017\/S0956796800003841","article-title":"On characterizations of the basic feasible functionals part i","volume":"11","author":"Irwin","year":"2001","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/S0097539794263452","article-title":"A new characerization of type-2 feasibility","volume":"25","author":"Kapron","year":"1996","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB14","series-title":"Feasible Mathematics","first-page":"71","article-title":"Characterizations of the basic feasible functionals of finite type","author":"Kapron","year":"1990"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB15","series-title":"Feasible Mathematics","first-page":"281","article-title":"Subrecursion and lambda representation over free algebras","author":"Leivant","year":"1990"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB16","series-title":"Feasible Mathematics II","first-page":"320","article-title":"Ramified recurrence and computational complexity I: Word recurrence and poly-time","author":"Leivant","year":"1994"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB17","series-title":"Computer Science Logic 2002","article-title":"Implicit computational complexity for higher type functionals","author":"Leivant","year":"2002"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB18","first-page":"147","article-title":"Polynomial and abstract subrecursive classes","volume":"12","author":"Mehlhorn","year":"1976","journal-title":"JCSS"},{"key":"10.1016\/S1571-0661(04)80495-X_NEWBIB19","doi-asserted-by":"crossref","unstructured":"Anil Seth. Some desirable conditions for feasible functionals of type 2. In Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, pages 320\u2013331, Washington, DC, 1993. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1993.287576"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480495X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480495X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:57Z","timestamp":1761609957000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610480495X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S157106610480495X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80495-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Feasible functionals and intersection of ramified types","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80495-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}