{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:05:01Z","timestamp":1743134701312,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662544334"},{"type":"electronic","value":"9783662544341"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54434-1_25","type":"book-chapter","created":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T04:20:06Z","timestamp":1489810806000},"page":"668-695","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Power of Non-determinism in Higher-Order Implicit Complexity"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Kop","sequence":"first","affiliation":[]},{"given":"Jakob Grue","family":"Simonsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,19]]},"reference":[{"key":"25_CR1","unstructured":"Bellantoni, S.: Ph.D. thesis, University of Toronto (1993)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Comput. Complex. 2, 97\u2013110 (1992)","journal-title":"Comput. Complex."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BFb0055060","volume-title":"Automata, Languages and Programming","author":"AM Ben-Amram","year":"1998","unstructured":"Ben-Amram, A.M., Petersen, H.: CONS-free programs with tree input. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 271\u2013282. Springer, Heidelberg (1998). doi:10.1007\/BFb0055060"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11784180_8","volume-title":"Algebraic Methodology and Software Technology","author":"G Bonfante","year":"2006","unstructured":"Bonfante, G.: Some programming languages for Logspace and Ptime. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 66\u201380. Springer, Heidelberg (2006). doi:10.1007\/11784180_8"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Clote, P.: Computation models and function algebras. In: Handbook of Computability Theory, pp. 589\u2013681. Elsevier (1999)","DOI":"10.1016\/S0049-237X(99)80033-0"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/321623.321625","volume":"18","author":"SA Cook","year":"1971","unstructured":"Cook, S.A.: Characterizations of pushdown machines in terms of time-bounded computers. J. ACM 18(1), 4\u201318 (1971)","journal-title":"J. ACM"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-319-08918-8_13","volume-title":"Rewriting and Typed Lambda Calculi","author":"D de Carvalho","year":"2014","unstructured":"de Carvalho, D., Simonsen, J.G.: An implicit characterization of the polynomial-time decidable sets by cons-free rewriting. In: Dowek, G. (ed.) RTA 2014. LNCS, vol. 8560, pp. 179\u2013193. Springer, Cham (2014). doi:10.1007\/978-3-319-08918-8_13"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90062-K","volume":"101","author":"A Goerdt","year":"1992","unstructured":"Goerdt, A.: Characterizing complexity classes by general recursive definitions in higher types. Inf. Comput. 101(2), 202\u2013218 (1992)","journal-title":"Inf. Comput."},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(92)90363-K","volume":"100","author":"A Goerdt","year":"1992","unstructured":"Goerdt, A.: Characterizing complexity classes by higher type primitive recursive definitions. Theor. Comput. Sci. 100(1), 45\u201366 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, New York (1999)"},{"key":"25_CR11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and Complexity from a Programming Perspective","author":"N Jones","year":"1997","unstructured":"Jones, N.: Computability and Complexity from a Programming Perspective. MIT Press, Cambridge (1997)"},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1017\/S0956796800003889","volume":"11","author":"N Jones","year":"2001","unstructured":"Jones, N.: The expressive power of higher-order types or, life without CONS. J. Funct. Program. 11(1), 55\u201394 (2001)","journal-title":"J. Funct. Program."},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1145\/174652.174659","volume":"41","author":"AJ Kfoury","year":"1994","unstructured":"Kfoury, A.J., Tiuryn, J., Urzyczyn, P.: An analysis of ML typability. J. ACM 41(2), 368\u2013398 (1994)","journal-title":"J. ACM"},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Kop, C., Simonsen, J.: Complexity hierarchies and higher-order cons-free rewriting. In: Kesner, D., Pientka, B. (eds.) FSCD. LIPIcs, vol. 52, pp. 23:1\u201323:18 (2016). 10.4230\/LIPIcs.FSCD.2016.23","DOI":"10.4230\/LIPIcs.FSCD.2016.23"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Kop, C., Simonsen, J.: The power of non-determinism in higher-order implicit complexity (extended version). Technical report, University of Copenhagen (2017). https:\/\/arxiv.org\/pdf\/1701.05382.pdf","DOI":"10.1007\/978-3-662-54434-1_25"},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00224-011-9377-9","volume":"51","author":"L Kristiansen","year":"2012","unstructured":"Kristiansen, L., Mender, B.M.W.: Non-determinism in G\u00f6del\u2019s system T. Theory Comput. Syst. 51(1), 85\u2013105 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2003.10.016","volume":"318","author":"L Kristiansen","year":"2004","unstructured":"Kristiansen, L., Niggl, K.-H.: Implicit computational complexity on the computational complexity of imperative programming languages. Theor. Comput. Sci. 318(1), 139\u2013161 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"25_CR18","first-page":"89","volume":"12","author":"L Kristiansen","year":"2005","unstructured":"Kristiansen, L., Voda, P.J.: Programming languages capturing complexity classes. Nord. J. Comput. 12(2), 89\u2013115 (2005)","journal-title":"Nord. J. Comput."},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-31485-8_3","volume-title":"Lectures on Logic and Computation","author":"U Dal Lago","year":"2012","unstructured":"Dal Lago, U.: A short introduction to implicit computational complexity. In: Bezhanishvili, N., Goranko, V. (eds.) ESSLLI 2010-2011. LNCS, vol. 7388, pp. 89\u2013109. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31485-8_3"},{"issue":"8","key":"25_CR20","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.apal.2011.01.010","volume":"162","author":"I Oitavem","year":"2011","unstructured":"Oitavem, I.: A recursion-theoretic approach to NP. Ann. Pure Appl. Log. 162(8), 661\u2013666 (2011)","journal-title":"Ann. Pure Appl. Log."},{"key":"25_CR21","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"25_CR22","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2006","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Thomson Course Technology, Boston (2006)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54434-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T15:49:40Z","timestamp":1635263380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54434-1_25"}},"subtitle":["Characterising Complexity Classes Using Non-deterministic Cons-Free Programming"],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544334","9783662544341"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54434-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2017a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/esop","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}