{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:26Z","timestamp":1784484146465,"version":"3.55.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_5","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:48Z","timestamp":1784482188000},"page":"78-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The New French School of\u00a0Philosophy of\u00a0Computing"],"prefix":"10.1007","author":[{"given":"Paula","family":"Quinon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Baillot, P. (ed.): Proceedings International Workshop on Developments in Implicit Computational Complexity (DICE 2010). EPTCS 23 (2010). https:\/\/doi.org\/10.4204\/EPTCS.23","DOI":"10.4204\/EPTCS.23"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Barthe, G., Gr\u00e9goire, B., Pastawski, F.: CIC$$\\widehat{\\ }$$: type-based termination of recursive definitions in the Calculus of Inductive Constructions. In: LPAR 2006. LNCS, vol. 4246, pp. 257\u2013271. Springer (2006). https:\/\/doi.org\/10.1007\/11916277_18","DOI":"10.1007\/11916277_18"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Berry, G., Curien, P.-L.: Sequential algorithms on concrete data structures. Theor. Comput. Sci. 20, 265\u2013321 (1982). https:\/\/doi.org\/10.1016\/S0304-3975(82)80002-9","DOI":"10.1016\/S0304-3975(82)80002-9"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretations: a way to control resources. Theor. Comput. Sci. 412(25), 2776\u20132796 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.02.007","DOI":"10.1016\/j.tcs.2011.02.007"},{"key":"5_CR5","unstructured":"Casinghino, C.: Strong normalization for the calculus of constructions. arXiv:2210.11240 (2022)"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Colson, L.: About primitive recursive algorithms. Theor. Comput. Sci. 83, 57\u201369 (1991). https:\/\/doi.org\/10.1016\/0304-3975(91)90039-5","DOI":"10.1016\/0304-3975(91)90039-5"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Colson, L., Fredholm, D.: System T, call-by-value and the minimum problem. Theor. Comput. Sci. 206, 301\u2013315 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(98)00011-5","DOI":"10.1016\/S0304-3975(98)00011-5"},{"key":"5_CR8","unstructured":"Coquand, T.: Une th\u00e9orie des constructions. Th\u00e8se de troisi\u00e8me cycle, Universit\u00e9 Paris VII (1985)"},{"issue":"314","key":"5_CR9","first-page":"389","volume":"I","author":"T Coquand","year":"1992","unstructured":"Coquand, T.: Une preuve directe du th\u00e9or\u00e8me d\u2019ultime obstination. Comptes rendus de l\u2019Acad\u00e9mie des sciences, s\u00e9rie I(314), 389\u2013392 (1992)","journal-title":"Comptes rendus de l\u2019Acad\u00e9mie des sciences, s\u00e9rie"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Inf. Comput. 76, 95\u2013120 (1988). https:\/\/doi.org\/10.1016\/0890-5401(88)90005-3","DOI":"10.1016\/0890-5401(88)90005-3"},{"key":"5_CR11","unstructured":"Crolard, T., Polonowski, E., Valarcher, P.: Extending the loop language with higher-order procedural variables. In: 2nd International Workshop on Higher-Order Rewriting (HOR 2004)\/WRS (2005)"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Crolard, T., Polonowski, E., Valarcher, P.: A Representation theorem for primitive recursive algorithms. Fundamenta Informaticae 107(4), 313\u2013330 (2011). https:\/\/doi.org\/10.3233\/FI-2011-405","DOI":"10.3233\/FI-2011-405"},{"key":"5_CR13","unstructured":"Curien, P.-L.: Sequential algorithms \u201cfrom the source\u201d (talk slides) (2022). https:\/\/curien.galene.org\/presentations\/SA-friends-2022.pdf"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"David, R.: On the asymptotic behaviour of primitive recursive algorithms. Theor. Comput. Sci. 266(1\u20132), 159\u2013193 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00165-1","DOI":"10.1016\/S0304-3975(00)00165-1"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Dowek, G.: The undecidability of pattern matching in calculi where primitive recursive functions are representable. Theor. Comput. Sci. 107, 349\u2013356 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90175-S","DOI":"10.1016\/0304-3975(93)90175-S"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Geometry of interaction I: interpretation of system F. In: Logic Colloquium \u201988, pp. 221\u2013260. North-Holland (1989)","DOI":"10.1016\/S0049-237X(08)70271-4"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Geometry of interaction III: accommodating the additives. In: Advances in Linear Logic, pp. 329\u2013389. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511629150.017"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Krivine, J.-L.: Typed lambda-calculus in classical Zermelo\u2013Fraenkel set theory. Arch. Math. Logic 40(3), 189\u2013205 (2001). https:\/\/doi.org\/10.1007\/s001530000057","DOI":"10.1007\/s001530000057"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Krivine, J.-L.: Dependent choice, \u201cquote\u201d and the clock. Theor. Comput. Sci. 308(1\u20133), 259\u2013276 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00776-4","DOI":"10.1016\/S0304-3975(02)00776-4"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Krivine, J.-L.: A call-by-name lambda-calculus machine. High.-Order Symbolic Comput. 20(3), 199\u2013207 (2007). https:\/\/doi.org\/10.1007\/s10990-007-9018-9","DOI":"10.1007\/s10990-007-9018-9"},{"key":"5_CR21","unstructured":"Krivine, J.-L.: Realizability in classical logic. In: Interactive Models of Computation and Program Behaviour. Panoramas et synth\u00e8ses 27, pp. 197\u2013229. SMF (2009)"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Leivant, D., Marion, J.-Y.: Lambda calculus characterizations of poly-time. Fundamenta Informaticae 19(1\/2), 167\u2013184 (1993). https:\/\/doi.org\/10.1007\/BFb0037112","DOI":"10.1007\/BFb0037112"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Quinon, P.: Intensional differences between programming languages: a conceptual and practical analysis. Philosophies 10(6), 129 (2025). https:\/\/doi.org\/10.3390\/philosophies10060129","DOI":"10.3390\/philosophies10060129"},{"key":"5_CR24","unstructured":"Seiller, T.: Interaction graphs: graphings. arXiv:1405.6331 (2014)"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Streicher, T., Reus, B.: Classical logic, continuation semantics and abstract machines. J. Funct. Program. 8(6), 543\u2013572 (1998). https:\/\/doi.org\/10.1017\/S0956796898003141","DOI":"10.1017\/S0956796898003141"},{"key":"5_CR26","unstructured":"Valarcher, P.: Contribution \u00e0 l\u2019\u00e9tude des algorithmes primitifs r\u00e9cursifs. PhD thesis, Universit\u00e9 Paris 7 (1996)"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Van den Dries, L.: Generating the greatest common divisor, and limitations of primitive recursive algorithms. Found. Comput. Math. 3(3), 297\u2013324 (2003). https:\/\/doi.org\/10.1007\/s10208-002-0061-y","DOI":"10.1007\/s10208-002-0061-y"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Arana, A.: The changing practices of proof in mathematics: Gilles Dowek, Comput., Proof, Mach. Metasci. 26(1), 131\u2013135 (2017). https:\/\/doi.org\/10.1007\/s11016-016-0150-1","DOI":"10.1007\/s11016-016-0150-1"}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:50Z","timestamp":1784482190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}