{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:49:08Z","timestamp":1762458548661},"publisher-location":"Berlin, Heidelberg","reference-count":52,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657651"},{"type":"electronic","value":"9783540489580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48958-4_11","type":"book-chapter","created":{"date-parts":[[2007,7,23]],"date-time":"2007-07-23T02:11:42Z","timestamp":1185156702000},"page":"199-218","source":"Crossref","is-referenced-by-count":9,"title":["Improving Homeomorphic Embedding for Online Termination"],"prefix":"10.1007","author":[{"given":"Michael","family":"Leuschel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/3-540-49727-7_16","volume-title":"Proceedings of SAS\u201998","author":"E. Albert","year":"1998","unstructured":"E. Albert, M. Alpuente, M. Falaschi, P. Juli\u00e1n, and G. Vidal. Improving control in functional logic program specialization. In G. Levi, editor, Static Analysis. Proceedings of SAS\u201998, LNCS 1503, pages 262\u2013277, Pisa, Italy, September 1998. Springer-Verlag."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"M. Alpuente, M. Falaschi, P. Juli\u00e1n, and G. Vidal. Spezialisation of lazy functional logic programs. In Proceedings of PEPM\u201997, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 151\u2013162, Amsterdam, The Netherlands, 1997. ACM Press.","DOI":"10.1145\/258994.259015"},{"key":"11_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-61055-3_28","volume-title":"Proceedings of the 6th European Symposium on Programming, ESOP\u201996","author":"M. Alpuente","year":"1996","unstructured":"M. Alpuente, M. Falaschi, and G. Vidal. Narrowing-driven partial evaluation of functional logic programs. In H. Riis Nielson, editor, Proceedings of the 6th European Symposium on Programming, ESOP\u201996, LNCS 1058, pages 45\u201361. Springer-Verlag, 1996."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"K. R. Apt. Introduction to logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 10, pages 495\u2013574. North-Holland Amsterdam, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"issue":"1&2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0743-1066(93)90022-9","volume":"16","author":"R. Bol","year":"1993","unstructured":"R. Bol. Loop checking in partial deduction. The Journal of Logic Programming, 16(1&2):25\u201346, 1993.","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"11_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03037527","volume":"11","author":"M. Bruynooghe","year":"1992","unstructured":"M. Bruynooghe, D. De Schreye, and B. Martens. A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing, 11(1):47\u201379, 1992.","journal-title":"New Generation Computing"},{"issue":"&","key":"11_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","author":"D. Schreye","year":"1994","unstructured":"D. De Schreye and S. Decorte. Termination of logic programs: The never ending story. The Journal of Logic Programming, 19 & 20:199\u2013260, May 1994.","journal-title":"The Journal of Logic Programming"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"D. De Schreye, R. Gl\u00fcck, J. J\u00f8rgensen, M. Leuschel, B. Martens, and M. H. S\u00f8rensen. Conjunctive partial deduction: Foundations, control, algorithms and experiments. To appear in The Journal of Logic Programming, 1999.","DOI":"10.1016\/S0743-1066(99)00030-8"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 243\u2013320. Elsevier, MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"8","key":"11_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465\u2013476, 1979.","journal-title":"Communications of the ACM"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"J. Gallagher. Tutorial on specialisation of logic programs. In Proceedings of PEPM\u201993, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88\u201398. ACM Press, 1993.","DOI":"10.1145\/154630.154640"},{"key":"11_CR13","unstructured":"R. Gl\u00fcck and J. Hatcliff, John J\u00f8rgensen. Generalization in hierarchies of online program specialization systems. In this volume."},{"key":"11_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/3-540-61756-6_83","volume-title":"Proceedings of the International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP\u201996)","author":"R. Gl\u00fcck","year":"1996","unstructured":"R. Gl\u00fcck, J. J\u00f8rgensen, B. Martens, and M. H. S\u00f8rensen. Controlling conjunctive partial deduction of definite logic programs. In H. Kuchen and S. Swierstra, editors, Proceedings of the International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP\u201996), LNCS 1140, pages 152\u2013166, Aachen, Germany, September 1996. Springer-Verlag."},{"key":"11_CR15","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":"R. Gl\u00fcck and M. H. S\u00f8rensen. A roadmap to supercompilation. In O. Danvy, R. Gl\u00fcck, and P. Thiemann, editors, Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110, pages 137\u2013160, Schlo\u00df Dagstuhl, 1996. Springer-Verlag."},{"key":"11_CR16","unstructured":"J. Gustedt. Algorithmic Aspects of Ordered Structures. PhD thesis, Technische Universit\u00e4t Berlin, 1992."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"G. Higman. Ordering by divisibility in abstract algebras. Proceedings of the LondonMathematical Society, 2:326\u2013336, 1952.","journal-title":"Proceedings of the LondonMathematical Society"},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797\u2013821, 1980.","journal-title":"Journal of the ACM"},{"key":"11_CR19","unstructured":"N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993."},{"key":"11_CR20","series-title":"Lect Notes Comput Sci","first-page":"59","volume-title":"Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR\u201996)","author":"J. J\u00f8rgensen","year":"1996","unstructured":"J. J\u00f8rgensen, M. Leuschel, and B. Martens. Conjunctive partial deduction in practice. In J. Gallagher, editor, Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR\u201996), LNCS 1207, pages 59\u201382, Stockholm, Sweden, August 1996. Springer-Verlag."},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"210","DOI":"10.2307\/1993287","volume":"95","author":"J. B. Kruskal","year":"1960","unstructured":"J. B. Kruskal. Well-quasi ordering, the tree theorem, and Vazsonyi\u2019s conjecture. Transactions of the American Mathematical Society, 95:210\u2013225, 1960.","journal-title":"Transactions of the American Mathematical Society"},{"key":"11_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-49674-2_9","volume-title":"Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR\u201997)","author":"L. Lafave","year":"1998","unstructured":"L. Lafave and J. Gallagher. Constraint-based partial evaluation of rewriting-based functional logic programs. In N. Fuchs, editor, Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR\u201997), LNCS 1463, pages 168\u2013188, Leuven, Belgium, July 1998."},{"key":"11_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/3-540-54345-7_45","volume-title":"Mathematical Foundations of Computer Science 1991","author":"P. Lescanne","year":"1991","unstructured":"P. Lescanne. Rewrite orderings and termination of rewrite systems. In A. Tarlecki, editor, Mathematical Foundations of Computer Science 1991, LNCS 520, pages 17\u201327, Kazimierz Dolny, Poland, September 1991. Springer-Verlag."},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"P. Lescanne. Well rewrite orderings and well quasi-orderings. Technical Report No 1385, INRIA-Lorraine,France, January 1991.","DOI":"10.1016\/0747-7171(92)90015-V"},{"key":"11_CR25","unstructured":"M. Leuschel. The ecce partial deduction system and the dppd library of benchmarks. Obtainable via http:\/\/www.cs.kuleuven.ac.be\/~dtai , 1996"},{"key":"11_CR26","unstructured":"M. Leuschel. Advanced Techniques for Logic Program Specialisation. PhD thesis, K.U. Leuven, May 1997. Accessible via http:\/\/www.ecs.soton.ac.uk\/~mal ."},{"key":"11_CR27","volume-title":"Technical Report DSSE-TR-98-11","author":"M. Leuschel","year":"1998","unstructured":"M. Leuschel. Homeomorphic embedding for online termination. Technical Report DSSE-TR-98-11, Department of Electronics and Computer Science, University of Southampton, UK, October 1998."},{"key":"11_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-49727-7_14","volume-title":"Proceedings of SAS\u201998","author":"M. Leuschel","year":"1998","unstructured":"M. Leuschel. On the power of homeomorphic embedding for online termination. In G. Levi, editor, Static Analysis. Proceedings of SAS\u201998, LNCS 1503, pages 230\u2013245, Pisa, Italy, September 1998. Springer-Verlag."},{"issue":"3","key":"11_CR29","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF03037483","volume":"16","author":"M. Leuschel","year":"1998","unstructured":"M. Leuschel and D. De Schreye. Constrained partial deduction and the preservation of characteristic trees. New Generation Computing, 16(3):283\u2013342, 1998.","journal-title":"New Generation Computing"},{"key":"11_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-61580-6_13","volume-title":"Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation","author":"M. Leuschel","year":"1996","unstructured":"M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. In O. Danvy, R. Gl\u00fcck, and P. Thiemann, editors, Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110, pages 263\u2013283, Schlo\u00df Dagstuhl, 1996. Springer-Verlag."},{"issue":"1","key":"11_CR31","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/271510.271525","volume":"20","author":"M. Leuschel","year":"1998","unstructured":"M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and poly-variance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems, 20(1):208\u2013258, January 1998.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"11_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-49674-2_11","volume-title":"Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR\u201997)","author":"N. Lindenstrauss","year":"1998","unstructured":"N. Lindenstrauss, Y. Sagiv, and A. Serebrenik. Unfolding the mystery of mergesort. In N. Fuchs, editor, Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR\u201997), LNCS 1463, pages 206\u2013225, Leuven, Belgium, July 1998."},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"3& 4","key":"11_CR34","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. W. Lloyd","year":"1991","unstructured":"J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. The Journal of Logic Programming, 11(3& 4):217\u2013242, 1991.","journal-title":"The Journal of Logic Programming"},{"key":"11_CR35","unstructured":"R. Marlet. Vers une Formalisation de l\u2019Evaluation Partielle. PhD thesis, Universit\u00e9 de Nice-Sophia Antipolis, December 1994."},{"key":"11_CR36","unstructured":"B. Martens. On the Semantics of Meta-Programming and the Control of Partial Deduction in Logic Programming. PhD thesis, K.U. Leuven, February 1994."},{"issue":"2","key":"11_CR37","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0743-1066(95)00149-2","volume":"28","author":"B. Martens","year":"1996","unstructured":"B. Martens and D. De Schreye. Automatic finite unfolding using well-founded measures. The Journal of Logic Programming, 28(2):89\u2013146, August 1996.","journal-title":"The Journal of Logic Programming"},{"issue":"1-2","key":"11_CR38","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(94)90203-8","volume":"122","author":"B. Martens","year":"1994","unstructured":"B. Martens, D. De Schreye, and T. Horv\u00e1th. Sound and complete partial deduction with unfolding based on well-founded measures. Theoretical Computer Science, 122(1-2):97\u2013117, 1994.","journal-title":"Theoretical Computer Science"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling, editor, Proceedings ICLP\u201995, pages 597\u2013613, Kanagawa, Japan, June 1995. MIT Press.","DOI":"10.7551\/mitpress\/4298.003.0059"},{"issue":"1","key":"11_CR40","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0304-3975(96)00172-7","volume":"175","author":"A. Middeldorp","year":"1997","unstructured":"A. Middeldorp and H. Zantema. Simple termination of rewrite systems. Theoretical Computer Science, 175(1):127\u2013158, 1997.","journal-title":"Theoretical Computer Science"},{"key":"11_CR41","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52837-7","volume-title":"Termination Proofs for Logic Programs","author":"L. Pl\u00fcmer","year":"1990","unstructured":"L. Pl\u00fcmer. Termination Proofs for Logic Programs. LNCS446. Springer-Verlag, 1990."},{"key":"11_CR42","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0747-7171(89)80035-5","volume":"8","author":"L. Puel","year":"1989","unstructured":"L. Puel. Using unavoidable set of trees to generalize Kruskal\u2019s theorem. Journal of Symbolic Computation, 8:335\u2013382, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR43","unstructured":"E. Ruf. Topics in Online Partial Evaluation. PhD thesis, Stanford University, March1993."},{"issue":"1","key":"11_CR44","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF03038271","volume":"12","author":"D. Sahlin","year":"1993","unstructured":"D. Sahlin. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12(1):7\u201351, 1993.","journal-title":"New Generation Computing"},{"key":"11_CR45","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BFb0054297","volume-title":"Mathematics of Program Construction, Proceedings of MPC\u201998","author":"M. H. S\u00f8rensen","year":"1998","unstructured":"M. H. S\u00f8rensen. Convergence of program transformers in the metric space of trees. In Mathematics of Program Construction, Proceedings of MPC\u201998, LNCS 1422, pages 315\u2013337. Springer-Verlag, 1998."},{"key":"11_CR46","unstructured":"M. H. S\u00f8rensen and R. Gl\u00fcck. An algorithm of generalization in positive supercompilation. In J. W. Lloyd, editor, Proceedings of ILPS\u201995, the International Logic Programming Symposium, pages 465\u2013479, Portland, USA, December 1995. MIT Press."},{"issue":"6","key":"11_CR47","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"M. H. S\u00f8rensen","year":"1996","unstructured":"M. H. S\u00f8rensen, R. Gl\u00fcck, and N. D. Jones. A positive supercompiler. Journal of Functional Programming, 6(6):811\u2013838, 1996.","journal-title":"Journal of Functional Programming"},{"key":"11_CR48","unstructured":"J. Stillman. Computational Problems in Equational Theorem Proving. PhD thesis, State University of New York at Albany, 1988."},{"issue":"3","key":"11_CR49","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"V. F. Turchin","year":"1986","unstructured":"V. F. Turchin. The concept of a supercompiler. ACM Transactions on Programming Languages and Systems, 8(3):292\u2013325, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"11_CR50","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/3-540-49674-2_17","volume-title":"Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR\u201997)","author":"W. Vanhoof","year":"1997","unstructured":"W. Vanhoof and B. Martens. To parse or not to parse. In N. Fuchs, editor, Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR\u201997), LNCS 1463, pages 322\u2013342, Leuven, Belgium, July 1997."},{"issue":"5","key":"11_CR51","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1006\/jsco.1994.1059","volume":"18","author":"A. Weiermann","year":"1994","unstructured":"A. Weiermann. Complexity bounds for some finite forms of Kruskal\u2019s theorem. Journal of Symbolic Computation, 18(5):463\u2013488, November 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR52","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3540543961_9","volume-title":"Proceedings of the Conference on Functional Programming Languages and Computer Architectures","author":"D. Weise","year":"1991","unstructured":"D. Weise, R. Conybeare, E. Ruf, and S. Seligman. Automatic online partial evaluation. In Proceedings of the Conference on Functional Programming Languages and Computer Architectures, LNCS 523, pages 165\u2013191, Harvard University, 1991. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48958-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T00:45:53Z","timestamp":1708130753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48958-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657651","9783540489580"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/3-540-48958-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}