@article(BC,
 author       = {Stephen Bellantoni and Stephen A. Cook},
 year         = {1992},
 title        = {A New Recursion-Theoretic Characterization of the Polytime Functions},
 journal      = {Computational Complexity},
 volume       = {2},
 pages        = {97--110},
 doi          = {10.1007/BF01201998},
)
@article(CCF94,
 author       = {R. Cartwright and P.L. Curien and M. Felleisen},
 year         = {1994},
 title        = {Fully Abstract Semantics for Observably Sequential Languages},
 journal      = {Information and Computation},
 volume       = {111},
 number       = {2},
 pages        = {297 -- 401},
 doi          = {10.1006/inco.1994.1047},
)
@incollection(Cobham,
 author       = {A. Cobham},
 year         = {1965},
 title        = {The intrinsic computational difficulty of functions},
 editor       = {Bar{-}Hillel, Yehoshua},
 booktitle    = {Logic, Methodology and Philosophy of Science: Proc. 1964 Intl. Congress (Studies in Logic and the Foundations of Mathematics)},
 publisher    = {North-Holland Publishing},
 pages        = {24--30},
)
@incollection(Cook,
 author       = {S.A. Cook},
 year         = {1992},
 title        = {Computability and complexity of higher type functions},
 booktitle    = {Logic from computer science ({B}erkeley, {CA}, 1989)},
 series       = {Math. Sci. Res. Inst. Publ.},
 volume       = {21},
 publisher    = {Springer, New York},
 pages        = {51--72},
 doi          = {10.1007/978-1-4612-2822-6\_3},
)
@incollection(CK,
 author       = {S.A. Cook and B.M. Kapron},
 year         = {1990},
 title        = {Characterizations of the basic feasible functionals of finite type},
 booktitle    = {Feasible mathematics ({I}thaca, {NY}, 1989)},
 series       = {Progr. Comput. Sci. Appl. Logic},
 volume       = {9},
 publisher    = {Birkh\"auser},
 pages        = {71--96},
 doi          = {10.1007/978-1-4612-3466-1\_5},
)
@article(CU,
 author       = {S.A. Cook and A. Urquhart},
 year         = {1993},
 title        = {Functional interpretations of feasibly constructive arithmetic},
 journal      = {Ann. Pure Appl. Logic},
 volume       = {63},
 number       = {2},
 pages        = {103--200},
 doi          = {10.1016/0168-0072(93)90044-E},
)
@article(Hof,
 author       = {Martin Hofmann},
 year         = {2003},
 title        = {Linear types and non-size-increasing polynomial time computation},
 journal      = {Inf. Comput.},
 volume       = {183},
 number       = {1},
 pages        = {57--85},
 doi          = {10.1016/S0890-5401(03)00009-9},
)
@article(Ign,
 author       = {A. Ignjatovic and A. Sharma},
 year         = {2004},
 title        = {Some applications of logic to feasibility in higher types},
 journal      = {ACM TOCL},
 volume       = {5},
 number       = {2},
 pages        = {332--350},
 doi          = {10.1145/976706.976713},
)
@article(KC,
 author       = {B.M. Kapron and S.A. Cook},
 year         = {1996},
 title        = {A new characterization of type-{$2$} feasibility},
 journal      = {SIAM J. Comput.},
 volume       = {25},
 number       = {1},
 pages        = {117--132},
 doi          = {10.1137/S0097539794263452},
)
@incollection(KS,
 author       = {B.M. Kapron and F. Steinberg},
 year         = {2018},
 title        = {Type-two polynomial-time and restricted lookahead},
 booktitle    = {{P}roceedings of the 33rd {A}nnual {ACM/IEEE} {S}ymposium on {L}ogic in {C}omputer {S}cience ({O}xford, {UK}), 2018},
 publisher    = {{ACM}, New York},
 pages        = {579--598},
 doi          = {10.1145/3209108.3209124},
)
@techreport(KapThes,
 author       = {Bruce M. Kapron},
 year         = {1991},
 title        = {Feasible Computation in Higher Types},
 type         = {Technical Report},
 number       = {249/91},
 institution  = {Computer Science Department, University of Toronto},
)
@inproceedings(DBLP:conf/rta/KawamuraS17,
 author       = {Akitoshi Kawamura and Florian Steinberg},
 year         = {2017},
 title        = {Polynomial Running Times for Polynomial-Time Oracle Machines},
 booktitle    = {2nd International Conference on Formal Structures for Computation and Deduction, {FSCD} 2017, September 3-9, 2017, Oxford, {UK}},
 pages        = {23:1--23:18},
 doi          = {10.4230/LIPIcs.FSCD.2017.23},
)
@inproceedings(Leivant,
 author       = {Daniel Leivant},
 year         = {1991},
 title        = {A Foundational Delineation of Computational Feasiblity},
 booktitle    = {Proceedings of the Sixth Annual {IEEE} Symposium on Logic in Computer Science (Amsterdam, The Netherlands), 1991},
 publisher    = {{IEEE} Computer Society},
 pages        = {2--11},
 doi          = {10.1109/LICS.1991.151625},
)
@article(Mehlhorn,
 author       = {K. Mehlhorn},
 year         = {1976},
 title        = {Polynomial and abstract subrecursive classes},
 journal      = {J. Comp. Sys. Sci.},
 volume       = {12},
 number       = {2},
 pages        = {147--178},
 doi          = {10.1016/S0022-0000(76)80035-9},
)
@article(robinson1947,
 author       = {Raphael M. Robinson},
 year         = {1947},
 title        = {Primitive recursive functions},
 journal      = {Bull. Amer. Math. Soc.},
 volume       = {53},
 number       = {10},
 pages        = {925--942},
 doi          = {10.1090/S0002-9904-1947-08911-4},
)
@incollection(MR1238294,
 author       = {Anil Seth},
 year         = {1993},
 title        = {Some desirable conditions for feasible functionals of type {$2$}},
 booktitle    = {Eighth {A}nnual {IEEE} {S}ymposium on {L}ogic in {C}omputer {S}cience ({M}ontreal, {PQ}, 1993)},
 publisher    = {IEEE Comput. Soc. Press, Los Alamitos, CA},
 pages        = {320--331},
 doi          = {10.1109/LICS.1993.287576},
)