{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T23:46:19Z","timestamp":1768002379684,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642114854","type":"print"},{"value":"9783642114861","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11486-1_17","type":"book-chapter","created":{"date-parts":[[2010,1,27]],"date-time":"2010-01-27T08:39:51Z","timestamp":1264581591000},"page":"193-205","source":"Crossref","is-referenced-by-count":11,"title":["Proving the Equivalence of Higher-Order Terms by Means of Supercompilation"],"prefix":"10.1007","author":[{"given":"Ilya","family":"Klyuchnikov","sequence":"first","affiliation":[]},{"given":"Sergei","family":"Romanenko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF03037257","volume":"20","author":"E. Albert","year":"2002","unstructured":"Albert, E., Vidal, G.: The narrowing-driven approach to functional logic program specialization. New Generation Computing\u00a020(1), 3\u201326 (2002)","journal-title":"New Generation Computing"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1145\/291891.291896","volume":"20","author":"M. Alpuente","year":"1998","unstructured":"Alpuente, M., Falaschi, M., Vidal, G.: Partial evaluation of functional logic programs. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a020(4), 768\u2013844 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S1571-0661(04)80904-6","volume":"44","author":"R. Cockett","year":"2001","unstructured":"Cockett, R.: Deforestation, program transformation, and cut-elimination. Electronic Notes in Theoretical Computer Science\u00a044(1), 88\u2013127 (2001)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-45699-6_4","volume-title":"Applied Semantics","author":"P. Dybjer","year":"2002","unstructured":"Dybjer, P., Filinski, A.: Normalization and partial evaluation. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol.\u00a02395, pp. 137\u2013192. Springer, Heidelberg (2002)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: Occam\u2019s razor in metacompuation: the notion of a perfect process tree. In: Cousot, P., Fil\u00e9, G., Falaschi, M., Rauzy, A. (eds.) WSA 1993. LNCS, vol.\u00a0724, pp. 112\u2013123. Springer, Heidelberg (1993)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/1244381.1244391","volume-title":"Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation","author":"G.W. Hamilton","year":"2007","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, pp. 61\u201370. ACM Press, New York (2007)"},{"key":"17_CR7","unstructured":"Hamilton, G.W., Kabir, M.H.: Constructing programs from metasystem transition proofs. In: Proceedings of the First International Workshop on Metacomputation in Russia (2008)"},{"key":"17_CR8","volume-title":"Functional Programming, Workshops in Computing","author":"C.K. Holst","year":"1990","unstructured":"Holst, C.K., Hughes, J.: Towards binding-time improvement for free. In: Functional Programming, Workshops in Computing, Glasgow. Springer, Heidelberg (1990)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Jonsson, P.A.: Positive supercompilation for a higher-order call-by-value language. Lule\u00e5 University of Technology (2008)","DOI":"10.1145\/1480881.1480916"},{"key":"17_CR10","unstructured":"Klimov, A.V.: A program specialization relation based on supercompilation and its properties. In: Proceedings of the First International Workshop on Metacomputation in Russia, pp. 54\u201378. Ailamazyan University of Pereslavl (2008)"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1142\/S0129054108006066","volume":"19","author":"A. Lisitsa","year":"2008","unstructured":"Lisitsa, A., Nemytykh, A.P.: Reachability analysis in verification via supercompilation. International Journal of Foundations of Computer Science\u00a019(4), 953\u2013969 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1134\/S0361768807010033","volume":"33","author":"A.P. Lisitsa","year":"2007","unstructured":"Lisitsa, A.P., Nemytykh, A.P.: Verification as a parameterized testing (experiments with the scp4 supercompiler). Programming and Computer Software\u00a033(1), 14\u201323 (2007)","journal-title":"Programming and Computer Software"},{"key":"17_CR13","unstructured":"Lisitsa, A.P., Webster, M.: Supercompilation for equivalence testing in metamorphic computer viruses detection. In: Proceedings of the First International Workshop on Metacomputation in Russia. Ailamazyan University of Pereslavl (2008)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-85373-2_9","volume-title":"Implementation and Application of Functional Languages","author":"N. Mitchell","year":"2008","unstructured":"Mitchell, N., Runciman, C.: A supercompiler for core haskell. In: Chitil, O., Horv\u00e1th, Z., Zs\u00f3k, V. (eds.) IFL 2007. LNCS, vol.\u00a05083, pp. 147\u2013164. Springer, Heidelberg (2008)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Pitts, A.M.: Operationally-based theories of program equivalence. In: Semantics and Logics of Computation, pp. 241\u2013298 (1997)","DOI":"10.1017\/CBO9780511526619.007"},{"key":"17_CR16","unstructured":"Romanenko, S.A.: Higher-order functions as a substitute for partial evaluation. In: Proceedings of the First International Workshop on Metacomputation in Russia. Ailamazyan University of Pereslavl (2008)"},{"issue":"6","key":"17_CR17","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"M.H. S\u00f8rensen","year":"1993","unstructured":"S\u00f8rensen, M.H., Gl\u00fcck, R., Jones, N.D.: A positive supercompiler. Journal of Functional Programming\u00a06(6), 811\u2013838 (1993)","journal-title":"Journal of Functional Programming"},{"key":"17_CR18","unstructured":"Turchin, V.F.: The Language Refal: The Theory of Compilation and Metasystem Analysis. Department of Computer Science, Courant Institute of Mathematical Sciences, New York University (1980)"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"V.F. Turchin","year":"1986","unstructured":"Turchin, V.F.: The concept of a supercompiler. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a08(3), 292\u2013325 (1986)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/3-540-61580-6_24","volume-title":"Partial Evaluation","author":"V.F. Turchin","year":"1996","unstructured":"Turchin, V.F.: Metacomputation: Metasystem transitions plus supercompilation. In: Danvy, O., Thiemann, P., Gl\u00fcck, R. (eds.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01110, pp. 481\u2013509. Springer, Heidelberg (1996)"},{"issue":"7","key":"17_CR21","first-page":"751","volume":"10","author":"D.A. Turner","year":"2004","unstructured":"Turner, D.A.: Total functional programming. Journal of Universal Computer Science\u00a010(7), 751\u2013768 (2004)","journal-title":"Journal of Universal Computer Science"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1145\/99370.99404","volume-title":"FPCA 1989: Proceedings of the fourth international conference on Functional programming languages and computer architecture","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for free! In: FPCA 1989: Proceedings of the fourth international conference on Functional programming languages and computer architecture, pp. 347\u2013359. ACM, New York (1989)"}],"container-title":["Lecture Notes in Computer Science","Perspectives of Systems Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11486-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:30:59Z","timestamp":1558287059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11486-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114854","9783642114861"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11486-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}