{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:59:45Z","timestamp":1743141585730,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662468227"},{"type":"electronic","value":"9783662468234"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-46823-4_19","type":"book-chapter","created":{"date-parts":[[2015,4,18]],"date-time":"2015-04-18T01:40:54Z","timestamp":1429321254000},"page":"232-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Supercompilation for Datatypes"],"prefix":"10.1007","author":[{"given":"Torben \u00c6gidius","family":"Mogensen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,19]]},"reference":[{"issue":"5","key":"19_CR1","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"75","author":"NG de Bruijn","year":"1972","unstructured":"de Bruijn, N.G.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem. Indagationes Math. (Proc.) 75(5), 381\u2013392 (1972)","journal-title":"Indagationes Math. (Proc.)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Dussart, D., Bevers, E., De Vlaminck, K.: Polyvariant constructor specialisation. In: Proceedings of ACM Conference on Partial Evaluation and Program Manipulation, pp. 546\u20135 (1995)","DOI":"10.1145\/215465.215554"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-57264-3_34","volume-title":"Static Analysis","author":"R Gl\u00fcck","year":"1993","unstructured":"Gl\u00fcck, R., Klimov, A.V.: Klimov. Occam\u2019s razor in metacomputation: the notion of a perfect process tree. In: Cousot, P., Falaschi, M., Fil\u00e9, G., Rauzy, A. (eds.) Static Analysis. LNCS, vol. 724, pp. 112\u2013123. Springer, Berlin Heidelberg (1993)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-61580-6_8","volume-title":"Partial Evaluation","author":"R Gl\u00fcck","year":"1996","unstructured":"Gl\u00fcck, R., S\u00f8rensen, M.H.: A roadmap to metacomputation by supercompilation. In: Danvy, O., Thiemann, P., Gl\u00fcck, R. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1110, pp. 137\u2013160. Springer, Heidelberg (1996)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Hamilton, G.W.: Distillation: extracting the essence of programs. In: Proceedings of the 2007 ACM SIGPLAN Symposium On Partial Evaluation And Semantics-based Program Manipulation, PEPM 2007, pp. 61\u201370. ACM, New York (2007)","DOI":"10.1145\/1244381.1244391"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Jones, S.L.P.: Call-pattern specialisation for haskell programs. In: Hinze, R., Ramsey, N. (eds.) ICFP, pp. 327\u2013337. ACM (2007)","DOI":"10.1145\/1291220.1291200"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-29709-0_18","volume-title":"Perspectives of Systems Informatics","author":"AV Klimov","year":"2012","unstructured":"Klimov, A.V.: Solving coverability problem for monotonic counter systems by supercompilation. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds.) PSI 2011. LNCS, vol. 7162, pp. 193\u2013209. Springer, Heidelberg (2012)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-11486-1_17","volume-title":"Perspectives of Systems Informatics","author":"I Klyuchnikov","year":"2010","unstructured":"Klyuchnikov, I., Romanenko, S.: Proving the equivalence of higher-order terms by means of supercompilation. In: Pnueli, A., Virbitskaite, I., Voronkov, A. (eds.) PSI 2009. LNCS, vol. 5947, pp. 193\u2013205. Springer, Heidelberg (2010)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF03037460","volume":"5","author":"P Kursawe","year":"1987","unstructured":"Kursawe, P.: How to invent a prolog machine. New Gener. Comput. 5, 97\u2013114 (1987). doi:10.1007\/BF03037460","journal-title":"New Gener. Comput."},{"key":"19_CR10","unstructured":"Krivine, J.L.: A call-by-name lambda-calculus machine. In Higher Order and Symbolic Computation, (2004)"},{"key":"19_CR11","first-page":"325","volume-title":"Partial Eval. Mixed Comput.","author":"T Mogensen","year":"1988","unstructured":"Mogensen, T.: Partially static structures in a self-applicable partial evaluator. In: Bjorner, D., Ershov, A.P., Jones, N.D. (eds.) Partial Eval. Mixed Comput., pp. 325\u2013347. North-Holland, Amsterdam (1988)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Mogensen,T.\u00c6. Constructor specialization. In: Partial Evaluation and Semantics-Based Program Manipulation (PEPM 1993), pp. 22\u201332. ACM, New York (1993)","DOI":"10.1145\/154630.154633"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61580-6_15","volume-title":"Partial Evaluation","author":"T\u00c6 Mogensen","year":"1996","unstructured":"Mogensen, T.\u00c6.: Evolution of partial evaluators: removing inherited limits. In: Danvy, O., Thiemann, P., Gl\u00fcck, R. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1110. Springer, Heidelberg (1996)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"30","DOI":"10.4204\/EPTCS.129.3","volume":"129","author":"T\u00c6 Mogensen","year":"2013","unstructured":"Mogensen, T.\u00c6.: A comparison of well-quasi orders on trees. Electron. Proc. Theor. Comput. Sci. 129, 30\u201340 (2013)","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-39866-0_18","volume-title":"Perspectives of System Informatics","author":"AP Nemytykh","year":"2004","unstructured":"Nemytykh, A.P.: The Supercompiler SCP4: general structure. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol. 2890, pp. 162\u2013170. Springer, Heidelberg (2004)"},{"key":"19_CR16","first-page":"465","volume":"6","author":"MH Sorensen","year":"1993","unstructured":"Sorensen, M.H., Gl\u00fcck, R., Jones, N.D.: A positive supercompiler. J. Funct. Program. 6, 465\u2013479 (1993)","journal-title":"J. Funct. Program."},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/954063.954069","volume":"14","author":"VF Turchin","year":"1979","unstructured":"Turchin, V.F.: A supercompiler system based on the language refal. SIGPLAN Not. 14(2), 46\u201354 (1979)","journal-title":"SIGPLAN Not."},{"issue":"3","key":"19_CR18","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"VF Turchin","year":"1986","unstructured":"Turchin, V.F.: The concept of a supercompiler. ACM Trans. Program. Lang. Syst. 8(3), 292\u2013325 (1986)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46823-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:40:35Z","timestamp":1676940035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46823-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662468227","9783662468234"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46823-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"19 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}