{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:45:57Z","timestamp":1743144357755,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030590246"},{"type":"electronic","value":"9783030590253"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59025-3_4","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T07:06:21Z","timestamp":1599721581000},"page":"50-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Time over the Reals with Parsimony"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Hainry","sequence":"first","affiliation":[]},{"given":"Damiano","family":"Mazza","sequence":"additional","affiliation":[]},{"given":"Romain","family":"P\u00e9choux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-16761-7_78","volume-title":"Automata, Languages and Programming","author":"NT M\u00fcller","year":"1986","unstructured":"M\u00fcller, N.T.: Subpolynomial complexity classes of real functions and real numbers. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 284\u2013293. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16761-7_78"},{"key":"4_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"KI Ko","year":"1991","unstructured":"Ko, K.I.: Complexity Theory of Real Functions. Birkh\u00e4user, Basel (1991). https:\/\/doi.org\/10.1007\/978-1-4684-6802-1"},{"key":"4_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis: An Introduction","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis: An Introduction. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/2189778.2189780","volume":"4","author":"A Kawamura","year":"2012","unstructured":"Kawamura, A., Cook, S.A.: Complexity theory for operators in analysis. TOCT 4(2), 5:1\u20135:24 (2012). https:\/\/doi.org\/10.1145\/2189778.2189780","journal-title":"TOCT"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1006\/jcom.1998.0488","volume":"14","author":"V Brattka","year":"1998","unstructured":"Brattka, V., Hertling, P.: Feasible real random access machines. J. Comp. 14(4), 490\u2013526 (1998). https:\/\/doi.org\/10.1006\/jcom.1998.0488","journal-title":"J. Comp."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2005.09.061","volume":"351","author":"A Ciaffaglione","year":"2006","unstructured":"Ciaffaglione, A., Di Gianantonio, P.: A certified, corecursive implementation of exact real numbers. TCS 351, 39\u201351 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2005.09.061","journal-title":"TCS"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-37075-5_22","volume-title":"Foundations of Software Science and Computation Structures","author":"P Di Gianantonio","year":"2013","unstructured":"Di Gianantonio, P., Edalat, A.: A language for differentiable functions. In: Pfenning, F. (ed.) FoSSaCS 2013. LNCS, vol. 7794, pp. 337\u2013352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37075-5_22"},{"issue":"1\u20133","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(03)00392-X","volume":"309","author":"T Ehrhard","year":"2003","unstructured":"Ehrhard, T., Regnier, L.: The differential lambda-calculus. TCS 309(1\u20133), 1\u201341 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(03)00392-X","journal-title":"TCS"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J Girard","year":"1998","unstructured":"Girard, J.: Light linear logic. Inf. Comput. 143(2), 175\u2013204 (1998). https:\/\/doi.org\/10.1006\/inco.1998.2700","journal-title":"Inf. Comput."},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0890-5401(03)00009-9","volume":"183","author":"M Hofmann","year":"2003","unstructured":"Hofmann, M.: Linear types and non-size-increasing polynomial time computation. Inf. Comput. 183(1), 57\u201385 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00009-9","journal-title":"Inf. Comput."},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Gaboardi, M., Rocca, S.R.D.: A soft type assignment system for lambda -calculus. In: CSL, pp. 253\u2013267 (2007). https:\/\/doi.org\/10.1007\/978-3-540-74915-8_21","DOI":"10.1007\/978-3-540-74915-8_21"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ic.2008.08.005","volume":"207","author":"P Baillot","year":"2009","unstructured":"Baillot, P., Terui, K.: Light types for polynomial time computation in $$\\lambda $$-calculus. Inf. Comput. 207(1), 41\u201362 (2009). https:\/\/doi.org\/10.1016\/j.ic.2008.08.005","journal-title":"Inf. Comput."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-662-47666-6_28","volume-title":"Automata, Languages, and Programming","author":"D Mazza","year":"2015","unstructured":"Mazza, D., Terui, K.: Parsimonious types and non-uniform computation. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 350\u2013361. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_28"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Mazza, D.: Simple parsimonious types and logarithmic space. In: CSL 2015, pp. 24\u201340 (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2015.24","DOI":"10.4230\/LIPIcs.CSL.2015.24"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Dal Lago, U.: Beta reduction is invariant, indeed. In: CSL-LICS 2014, pp. 8:1\u20138:10 (2014). https:\/\/doi.org\/10.1145\/2603088.2603105","DOI":"10.1145\/2603088.2603105"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.scico.2015.05.004","volume":"111","author":"M Gaboardi","year":"2015","unstructured":"Gaboardi, M., P\u00e9choux, R.: On bounding space usage of streams using interpretation analysis. Sci. Comput. Program. 111, 395\u2013425 (2015). https:\/\/doi.org\/10.1016\/j.scico.2015.05.004","journal-title":"Sci. Comput. Program."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2015.03.008","volume":"585","author":"H F\u00e9r\u00e9e","year":"2015","unstructured":"F\u00e9r\u00e9e, H., Hainry, E., Hoyrup, M., P\u00e9choux, R.: Characterizing polynomial time complexity of stream programs using interpretations. TCS 585, 41\u201354 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.03.008","journal-title":"TCS"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Gaboardi, M., P\u00e9choux, R.: Algebras and coalgebras in the light affine lambda calculus. In: ICFP, pp. 114\u2013126 (2015). https:\/\/doi.org\/10.1145\/2858949.2784759","DOI":"10.1145\/2858949.2784759"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Dal Lago, U.: Infinitary lambda calculi from a linear perspective. In: LICS, pp. 447\u2013456 (2016). https:\/\/doi.org\/10.1145\/2933575.2934505","DOI":"10.1145\/2933575.2934505"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45833-6_1","volume-title":"Unconventional Models of Computation","author":"ML Campagnolo","year":"2002","unstructured":"Campagnolo, M.L.: The complexity of real recursive functions. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 1\u201314. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45833-6_1"},{"issue":"5","key":"4_CR21","first-page":"331","volume":"7","author":"O Bournez","year":"2011","unstructured":"Bournez, O., Gomaa, W., Hainry, E.: Algebraic characterizations of complexity-theoretic classes of real functions. Int. J. Unconv. Comput. 7(5), 331\u2013351 (2011)","journal-title":"Int. J. Unconv. Comput."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-662-46678-0_27","volume-title":"Foundations of Software Science and Computation Structures","author":"D Leivant","year":"2015","unstructured":"Leivant, D., Ramyaa, R.: The computational contents of ramified corecurrence. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 422\u2013435. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46678-0_27"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Berger, U.: From coinductive proofs to exact real arithmetic: theory and applications. Log. Methods Comput. Sci. 7(1) (2011). https:\/\/doi.org\/10.2168\/LMCS-7(1:8)2011","DOI":"10.2168\/LMCS-7(1:8)2011"},{"issue":"3","key":"4_CR24","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00224-011-9325-8","volume":"51","author":"U Berger","year":"2012","unstructured":"Berger, U., Seisenberger, M.: Proofs, programs, processes. Theory Comput. Syst. 51(3), 313\u2013329 (2012). https:\/\/doi.org\/10.1007\/s00224-011-9325-8","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"GJ Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A theory of program size formally identical to information theory. J. ACM 22(3), 329\u2013340 (1975). https:\/\/doi.org\/10.1145\/321892.321894","journal-title":"J. ACM"},{"issue":"3","key":"4_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.tcs.2004.08.014","volume":"328","author":"P Baillot","year":"2004","unstructured":"Baillot, P.: Type inference for light affine logic via constraints on words. Theoret. Comput. Sci. 328(3), 289\u2013323 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.08.014","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Atassi, V., Baillot, P., Terui, K.: Verification of ptime reducibility for system F terms: type inference in dual light affine logic. Log. Methods Comput. Sci. 3(4) (2007). https:\/\/doi.org\/10.2168\/LMCS-3(4:10)2007","DOI":"10.2168\/LMCS-3(4:10)2007"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","volume":"175","author":"J Kennaway","year":"1997","unstructured":"Kennaway, J., Klop, J.W., Sleep, M.R., de Vries, F.J.: Infinitary lambda calculus. TCS 175(1), 93\u2013125 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(96)00171-5","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59025-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T14:26:21Z","timestamp":1619274381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59025-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590246","9783030590253"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59025-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FLOPS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Functional and Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Akita","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"flops2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ipl.riec.tohoku.ac.jp\/FLOPS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}