{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:09:56Z","timestamp":1743156596835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319631387"},{"type":"electronic","value":"9783319631394"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-63139-4_20","type":"book-chapter","created":{"date-parts":[[2017,7,23]],"date-time":"2017-07-23T23:22:55Z","timestamp":1500852175000},"page":"345-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Automata Theory Approach to Predicate Intuitionistic Logic"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Zielenkiewicz","sequence":"first","affiliation":[]},{"given":"Aleksy","family":"Schubert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"20_CR1","unstructured":"Ben-Yelles, C.B.: Type-assignment in the lambda-calculus; syntax and semantics. Ph.D. thesis, Mathematics Department, University of Wales, Swansea, UK (1979)"},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1093\/logcom\/exi016","volume":"15","author":"S Broda","year":"2005","unstructured":"Broda, S., Damas, L.: On long normal inhabitants of a type. J. Logic Comput. 15(3), 353\u2013390 (2005)","journal-title":"J. Logic Comput."},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-54833-8_5","volume-title":"Programming Languages and Systems","author":"B D\u00fcdder","year":"2014","unstructured":"D\u00fcdder, B., Martens, M., Rehof, J.: Staged composition synthesis. In: Shao, Z. (ed.) ESOP 2014. LNCS, vol. 8410, pp. 67\u201386. Springer, Heidelberg (2014). doi:\n                      10.1007\/978-3-642-54833-8_5"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S012905411000743X","volume":"21","author":"E Filiot","year":"2010","unstructured":"Filiot, E., Talbot, J., Tison, S.: Tree automata with global constraints. Int. J. Found. Comput. Sci. 21(4), 571\u2013596 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/inco.2002.3147","volume":"178","author":"P Groote de","year":"2002","unstructured":"de Groote, P.: On the strong normalisation of intuitionistic natural deduction with permutation-conversions. Inf. Comput. 178(2), 441\u2013464 (2002)","journal-title":"Inf. Comput."},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-28332-1_26","volume-title":"Language and Automata Theory and Applications","author":"S Hetzl","year":"2012","unstructured":"Hetzl, S.: Applying tree languages in proof theory. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 301\u2013312. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-28332-1_26"},{"key":"20_CR7","volume-title":"Natural Deduction","author":"D Prawitz","year":"1965","unstructured":"Prawitz, D.: Natural Deduction. Almqvist and Wiksell, Sweden (1965)"},{"key":"20_CR8","unstructured":"Schubert, A., Dekkers, W., Barendregt, H.P.: Automata theoretic account of proof search. In: Kreutzer, S. (ed.) 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). LIPIcs, vol. 41, pp. 128\u2013143. Dagstuhl (2015)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-662-46678-0_29","volume-title":"Foundations of Software Science and Computation Structures","author":"A Schubert","year":"2015","unstructured":"Schubert, A., Urzyczyn, P., Zdanowski, K.: On the mints hierarchy in first-order intuitionistic logic. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 451\u2013465. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-46678-0_29"},{"key":"20_CR10","unstructured":"Schubert, A., Urzyczyn, P., Walukiewicz-Chrzaszcz, D.: Restricted positive quantification is not elementary. In: Herbelin, H., Letouzey, P., Sozeau, M. (eds.) Proceedings of TYPES 2014. LIPIcs, vol. 39, pp. 251\u2013273. Dagstuhl (2015)"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1006\/inco.1996.0027","volume":"125","author":"M Takahashi","year":"1996","unstructured":"Takahashi, M., Akama, Y., Hirokawa, S.: Normal proofs and their grammar. Inf. Comput. 125(2), 144\u2013153 (1996)","journal-title":"Inf. Comput."},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Urzyczyn, P.: Intuitionistic games: determinacy, completeness, and normalization. Studia Logica 104(5), 957\u20131001 (2016). doi:\n                      10.1007\/s11225-016-9661-4","DOI":"10.1007\/s11225-016-9661-4"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63139-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:52:00Z","timestamp":1558320720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63139-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319631387","9783319631394"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63139-4_20","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":"25 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2016","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":"lopstr2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cliplab.org\/Conferences\/LOPSTR16\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}