{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:53:56Z","timestamp":1781855636494,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209134","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T08:14:43Z","timestamp":1530087283000},"page":"839-848","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A functional interpretation with state"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Powell","sequence":"first","affiliation":[{"name":"Department of Mathematics, Technische Universit\u00e4t Darmstadt"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Official homepage of Minlog, as of","year":"2018","unstructured":"http:\/\/www.mathematik.uni-muenchen.de\/~logik\/minlog\/. Official homepage of Minlog, as of January 2018."},{"key":"e_1_3_2_1_2_1","volume-title":"Interactive learning-based realizability for Heyting arithmetic with EM1. Logical Methods in Computer Science, 6(3)","author":"Aschieri F.","year":"2010","unstructured":"F. Aschieri and S. Berardi. Interactive learning-based realizability for Heyting arithmetic with EM1. Logical Methods in Computer Science, 6(3), 2010."},{"key":"e_1_3_2_1_3_1","first-page":"84","volume-title":"Proceedings of TYPES 2013","volume":"26","author":"Berger U.","year":"2014","unstructured":"U. Berger, M. Seisenberger, and G. Woods. Extracting imperative programs from proofs: In-place quicksort. In Proceedings of TYPES 2013, volume 26 of LIPIcs, pages 84--106, 2014."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275524"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-017-0555-6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-005-0275-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.019"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538363_33"},{"key":"e_1_3_2_1_9_1","volume-title":"Applied Proof Theory: Proof Interpretations and their Use in Mathematics. Monographs in Mathematics","author":"Kohlenbach U.","year":"2008","unstructured":"U. Kohlenbach. Applied Proof Theory: Proof Interpretations and their Use in Mathematics. Monographs in Mathematics. Springer, 2008."},{"key":"e_1_3_2_1_10_1","unstructured":"A. Kreuzer. Proof mining and Combinatorics: Program Extraction for Ramsey's Theorem for Pairs. PhD thesis TU Darmstadt 2012."},{"key":"e_1_3_2_1_11_1","series-title":"Panoramas et Synth\u00e8ses","first-page":"197","volume-title":"Interactive Models of Computation and Program Behaviour","author":"Krivine J.-L.","year":"2009","unstructured":"J.-L. Krivine. Realizability in classical logic. In Interactive Models of Computation and Program Behaviour, volume 27 of Panoramas et Synth\u00e8ses, pages 197--229. Soci\u00e9t\u00e9 Math\u00e9matique de France, 2009."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_3_2_1_13_1","volume-title":"Well Quasi-Orders in Computation, Logic, Language and Reasoning, Trends in Logic","author":"Powell T.","unstructured":"T. Powell. Well quasi-orders and the functional interpretation. To appear in: Schuster, P., Seisenberger, M. and Weiermann, A. editors, Well Quasi-Orders in Computation, Logic, Language and Reasoning, Trends in Logic, Springer."},{"key":"e_1_3_2_1_14_1","unstructured":"T. Trifonov. Analysis of Methods for Extraction of Programs from Non-Constructive Proofs. PhD thesis Ludwig-Maximilians-Universit\u00e4t Munich 2011."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2012.07.003"}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Oxford United Kingdom","acronym":"LICS '18","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","IEEE-CS\\DATC IEEE Computer Society","EACSL European Association for Computer Science Logic"]},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209134","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:32:49Z","timestamp":1781854369000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":15,"alternative-id":["10.1145\/3209108.3209134","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209134","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}