{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:07Z","timestamp":1725488527944},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410546"},{"type":"electronic","value":"9783540453505"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45350-4_8","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T05:45:53Z","timestamp":1186811153000},"page":"72-91","source":"Crossref","is-referenced-by-count":2,"title":["A New Termination Approach for Specialization"],"prefix":"10.1007","author":[{"given":"Litong","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshihiko","family":"Futamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"8_CR1","unstructured":"Andersen L.O. Program analysis and specialization for the C programming language, Ph.D. thesis, DIKU, University of Copenhagen (1994)."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(91)90002-F","volume":"16","author":"A. Bondorf","year":"1991","unstructured":"Bondorf A., Danvy O.Automatic autoprojection of recursive equations with global variables and abstract data types, Science of Computer Programming, Vol. 16, pp 151\u2013195 (1991).","journal-title":"Science of Computer Programming"},{"issue":"1","key":"8_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03037527","volume":"11","author":"M. Bruynooghe","year":"1992","unstructured":"Bruynooghe M., De Schreye D., Martens B. A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing,11(1): pp 47\u201379 (1992).","journal-title":"New Generation Computing"},{"key":"8_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/3-540-61580-6_4","volume-title":"A uniform approach for compile-time and run-time specialization","author":"C. Consel","year":"1996","unstructured":"Consel C. et al. A uniform approach for compile-time and run-time specialization. In: Danvy O., Gl\u00fcck R., Thiemann P. (eds.), Partial Evaluation. Proceedings. LNCS, Vol. 1110, pp54\u201372, Springer-Verlag (1996)."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz N. Termination of rewriting. Journal of Symbolic Computation, 3:69\u2013116 (1987).","journal-title":"Journal of Symbolic Computation"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"pp61","DOI":"10.1016\/0304-3975(91)90299-H","volume":"90","author":"Y. Futamura","year":"1991","unstructured":"Futamura Y., Nogi K., Takano A., Essence of generalized partial computation. Theoretical Computer Science 90, pp61\u201379 (1991).","journal-title":"Theoretical Computer Science"},{"key":"8_CR7","unstructured":"Futamura Y., Konishi Z, Implementation of experimental system for automatic program transformation based on generalized partial computation, to appear in Computer Software."},{"key":"8_CR8","unstructured":"Futamura Y., Song L., Konishi Z. Control structures and termination conditions for generalized partial computation (GPC), The 15th National Conference of Computer Software Society of Japan, D5-1, pp313\u2013316, 9,1998)"},{"key":"8_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-61580-6_8","volume-title":"Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation","author":"R. Gl\u00fcck","year":"1996","unstructured":"Gl\u00fcck R., S\u00f8rensen M. H. A roadmap to supercompilation. In Danvy O., Gl\u00fcck R., Thiemann P., editors. Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110, pp137\u2013160, Springer-Verlag (1996)."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman G. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 2: pp326\u2013336 (1952).","journal-title":"Proceedings of the London Mathematical Society"},{"key":"8_CR11","unstructured":"Kenneth Kunen. Handbook of mathematical logic. pp371\u2013401, Editted by Jon Brawise, North-Holland."},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"Knuth D. E., Morris J. H., Pratt V. R. Fast pattern matching in strings. SIAM Journal on Computing, 6(2): pp323\u2013350 (1977).","journal-title":"SIAM Journal on Computing"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"210","DOI":"10.2307\/1993287","volume":"95","author":"J. B. Kruskal","year":"1960","unstructured":"Kruskal J. B. Well-quasi ordering, the tree theorem, and Vazsonyi\u2019s conjecture. Transactions of the American Mathematical Society, 95: pp210\u2013225 (1960).","journal-title":"Transactions of the American Mathematical Society"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Leuschel M. On the power of homeomorphic embedding for online termination, SAS\u201998, pp230\u2013245 (1998).","DOI":"10.1007\/3-540-49727-7_14"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/271510.271525","volume":"20","author":"M. Leuschel","year":"1998","unstructured":"Leuschel M., Martens B., De Schreye D. Controlling generalization and polyvariance in partial deduction of normal logic programs, TOPLAS, 20(1), pp209\u2013258 (1998).","journal-title":"TOPLAS"},{"issue":"4","key":"8_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"McCarthy J. Recursive functions of symbolic expressions and their computation by machine. Communications of the ACM3(4): 184\u2013195 (1960).","journal-title":"Communications of the ACM"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0743-1066(95)00149-2","volume":"28","author":"B. Martens","year":"1996","unstructured":"Martens B., De Schreye D. Automatic finite unfolding using well-founded measures. The Journal of Logic Programming, 28(2): pp89\u2013146 (1996).","journal-title":"The Journal of Logic Programming"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Meyer U. Techniques for partial evalutaion of imperative languages, PEPM\u201991, pp94\u2013105 (1991).","DOI":"10.1145\/115866.115876"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0304-3975(96)00172-7","volume":"175","author":"A. Middeldorp","year":"1997","unstructured":"Middeldorp A., Zantema H. Simple termination of rewrite systems. Theoretical Computer Science, 175(1): pp127\u2013158 (1997).","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"8_CR20","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1017\/S0305004100003844","volume":"59","author":"Nash-Williams","year":"1963","unstructured":"Nash-Williams, C. St. J. A. On well-quasi-ordering finite trees, Proc. Cambridge Philos. Soc. 59(4) pp833\u2013835 (1963).","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"8_CR21","unstructured":"Ruf E. Topics in online partial evaluation. Ph.D thesis, Standford University (1993)."},{"issue":"1","key":"8_CR22","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF03038271","volume":"12","author":"D. Sahlin","year":"1993","unstructured":"Sahlin D. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12(1): pp7\u201351 (1993).","journal-title":"New Generation Computing"},{"key":"8_CR23","unstructured":"Song L., Futamura Y. A termination function of recursive programs and its application to partial evaluation, The 56th National Conference of Information Processing Society of Japan, 3E-4, pp312\u2013313, 3,1998."},{"key":"8_CR24","unstructured":"S\u00f8rensen M. H., Gl\u00fcck R. An algorithm of generalization in positive super-compilation. In J.W. Lloyd, editor, Proceedings ILOS\u201995, pp465\u2013479, Portland, USA (1995)."},{"issue":"6","key":"8_CR25","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"M. H. S\u00f8rensen","year":"1996","unstructured":"S\u00f8rensen M. H., Gl\u00fcck R., Jones N. D. A positive supercompiler. In: Journal of Functional Programming, 6(6): pp811\u2013838 (1996).","journal-title":"Journal of Functional Programming"},{"issue":"3","key":"8_CR26","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. TOPLAS, 8(3): pp292\u2013325 (1986).","journal-title":"TOPLAS"},{"key":"8_CR27","series-title":"Lect Notes Comput Sci","volume-title":"Proceeding of the Conference on Functional Programming Languages and Computer Architectures","author":"D. Weise","year":"1991","unstructured":"Weise D., ConybeareR., Ruf E., Seligman S. Automatic online partial evaluation. In:Proceeding of the Conference on Functional Programming Languages and Computer Architectures,LNCS523,pp165\u2013191, Harvard University, Springer-Verlag (1991)."}],"container-title":["Lecture Notes in Computer Science","Semantics, Applications, and Implementation of Program Generation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45350-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:03:21Z","timestamp":1556737401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45350-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410546","9783540453505"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45350-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}