@inproceedings{hainry:hal-03722245, TITLE = {{Complete and tractable machine-independent characterizations of second-order polytime}}, AUTHOR = {Hainry, Emmanuel and Kapron, Bruce M and Marion, Jean-Yves and P{\'e}choux, Romain}, URL = {https://inria.hal.science/hal-03722245}, BOOKTITLE = {{FoSSaCS 2022 - 25th International Conference on Foundations of Software Science and Computation Structures}}, ADDRESS = {Munich, Germany}, PUBLISHER = {{Springer International Publishing}}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {13242}, PAGES = {368-388}, YEAR = {2022}, MONTH = Apr, DOI = {10.1007/978-3-030-99253-8\_19}, KEYWORDS = {Basic feasible functionals ; Type 2 ; Second-order ; Polynomial time ; Tiering ; Safe recursion}, PDF = {https://inria.hal.science/hal-03722245/file/ctcbff.pdf}, HAL_ID = {hal-03722245}, HAL_VERSION = {v1}, }