{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:23:49Z","timestamp":1781893429644,"version":"3.54.5"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2001,3,26]],"date-time":"2001-03-26T00:00:00Z","timestamp":985564800000},"content-version":"unspecified","delay-in-days":84,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[2001,1]]},"abstract":"<jats:p>\n                    We introduce a typed programming formalism, type-2\n                    <jats:italic>inflationary tiered loop programs<\/jats:italic>\n                    or \n\nITLP\n                    <jats:sub>2<\/jats:sub>\n                    , that characterizes the type-2 basic feasible functionals. ITLP\n                    <jats:sub>2<\/jats:sub>\n                    is based on Bellantoni \n\nand Cook's (1992) and Leivant's (1995) type-theoretic characterization of polynomial-time, \n\nand turns out to be closely related to Kapron and Cook's (1991; 1996) machine-based \n\ncharacterization of the type-2 basic feasible functionals.\n                  <\/jats:p>","DOI":"10.1017\/s0956796800003841","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:26:15Z","timestamp":1027761975000},"page":"117-153","source":"Crossref","is-referenced-by-count":26,"title":["On characterizations of the basic feasible functionals, Part I"],"prefix":"10.1017","volume":"11","author":[{"given":"ROBERT J.","family":"IRWIN","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"JAMES S.","family":"ROYER","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"BRUCE M.","family":"KAPRON","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2001,3,26]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796800003841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:34:48Z","timestamp":1779834888000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796800003841\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0956796800003841"],"URL":"https:\/\/doi.org\/10.1017\/s0956796800003841","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}