{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:05:15Z","timestamp":1725559515086},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540266556"},{"type":"electronic","value":"9783540316831"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11506676_10","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T16:07:52Z","timestamp":1279469272000},"page":"149-165","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Local Unfolding with Ancestor Stacks for Full Prolog"],"prefix":"10.1007","author":[{"given":"Germ\u00e1n","family":"Puebla","sequence":"first","affiliation":[]},{"given":"Elvira","family":"Albert","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Compilers \u2013 Principles, Techniques and Tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers \u2013 Principles, Techniques and Tools. Addison-Wesley, Reading (1986)"},{"unstructured":"Albert, E., Hanus, M., Vidal, G.: A practical partial evaluation scheme for multi-paradigm declarative languages. Journal of Functional and Logic Programming\u00a02002(1) (2002)","key":"10_CR2"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M.: A Practical Framework for the Abstract Interpretation of Logic Programs. Journal of Logic Programming\u00a010, 91\u2013124 (1991)","journal-title":"Journal of Logic Programming"},{"issue":"11","key":"10_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF03037527","volume":"1","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\u00a01(11), 47\u201379 (1992)","journal-title":"New Generation Computing"},{"unstructured":"Bueno, F., Cabeza, D., Carro, M., Hermenegildo, M., L\u00f3pez-Garc\u00eda, P., Puebla, G. (eds.): The Ciao System. Reference Manual (v1.10). Technical Report CLIP3\/97.1.10(04), School of Computer Science (UPM) (August 2004), Available at http:\/\/clip.dia.fi.upm.es\/Software\/Ciao\/","key":"10_CR5"},{"issue":"1","key":"10_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1017\/S1471068402001114","volume":"2","author":"B. Charlier Le","year":"2002","unstructured":"Le Charlier, B., Rossi, S., Van Hentenryck, P.: Sequence Based Abstract Interpretation of Prolog. Theory and Practice of Logic Programming\u00a02(1), 25\u201384 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"10_CR7","first-page":"137","volume-title":"Proc. of the ACM Sigplan PEPM1997","author":"S. Etalle","year":"1997","unstructured":"Etalle, S., Gabbrielli, M., Marchiori, E.: A Transformation System for CLP with Dynamic Scheduling and CCP. In: Proc. of the ACM Sigplan PEPM1997, pp. 137\u2013150. ACM Press, New York (1997)"},{"key":"10_CR8","first-page":"88","volume-title":"Proceedings of PEPM1993, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation","author":"J.P. Gallagher","year":"1993","unstructured":"Gallagher, J.P.: Tutorial on specialisation of logic programs. In: Proceedings of PEPM1993, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 88\u201398. ACM Press, New York (1993)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-44898-5_8","volume-title":"Static Analysis","author":"M. Hermenegildo","year":"2003","unstructured":"Hermenegildo, M., Puebla, G., Bueno, F., L\u00f3pez-Garc\u00eda, P.: Program Development Using Abstract Interpretation (and The Ciao System Preprocessor). In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 127\u2013152. Springer, Heidelberg (2003)"},{"key":"10_CR10","first-page":"210","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\u00a095, 210\u2013225 (1960)","journal-title":"Transactions of the American Mathematical Society"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-58792-6_8","volume-title":"Logic Program Synthesis and Transformation - Meta-Programming in Logic","author":"M. Leuschel","year":"1994","unstructured":"Leuschel, M.: Partial evaluation of the \u201creal thing. In: Fribourg, L., Turini, F. (eds.) LOPSTR 1994 and META 1994. LNCS, vol.\u00a0883, pp. 122\u2013137. Springer, Heidelberg (1994)"},{"unstructured":"Leuschel, M.: The ecce partial deduction system and the dppd library of benchmarks (1996-2002). Obtainable via, http:\/\/www.ecs.soton.ac.uk\/~mal","key":"10_CR12"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-49727-7_14","volume-title":"Static Analysis","author":"M. Leuschel","year":"1998","unstructured":"Leuschel, M.: On the power of homeomorphic embedding for online termination. In: Levi, G. (ed.) SAS 1998. LNCS, vol.\u00a01503, pp. 230\u2013245. Springer, Heidelberg (1998)"},{"issue":"4 & 5","key":"10_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1017\/S147106840200145X","volume":"2","author":"M. Leuschel","year":"2002","unstructured":"Leuschel, M., Bruynooghe, M.: Logic program specialisation through partial deduction: Control issues. Theory and Practice of Logic Programming\u00a02(4 & 5), 461\u2013515 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/271510.271525","volume":"20","author":"M. Leuschel","year":"1998","unstructured":"Leuschel, M., Martens, B., De Schreye, D.: Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems\u00a020(1), 208\u2013258 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J.W. Lloyd","year":"1991","unstructured":"Lloyd, J.W., Shepherdson, J.C.: Partial evaluation in logic programming. The Journal of Logic Programming\u00a011, 217\u2013242 (1991)","journal-title":"The Journal of Logic Programming"},{"key":"10_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"issue":"2","key":"10_CR18","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\u00a028(2), 89\u2013146 (1996)","journal-title":"The Journal of Logic Programming"},{"doi-asserted-by":"crossref","unstructured":"Puebla, G., Albert, E., Hermenegildo, M.: Efficient Local Unfolding with Ancestor Stacks for Full Prolog. Technical Report CLIP2\/2005.0, Technical University of Madrid (February 2005)","key":"10_CR19","DOI":"10.1007\/11506676_10"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/10722311_2","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"G. Puebla","year":"2000","unstructured":"Puebla, G., Bueno, F., Hermenegildo, M.: An Assertion Language for Constraint Logic Programs. In: Deransart, P., Ma\u0142uszy\u0144ski, J. (eds.) DiSCiPl 1999. LNCS, vol.\u00a01870, pp. 23\u201361. Springer, Heidelberg (2000)"},{"volume-title":"Handbook of Formal Languages: Word Language Grammar","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages: Word Language Grammar, vol.\u00a01. Springer, Heidelberg (1997)","key":"10_CR21"},{"key":"10_CR22","first-page":"465","volume-title":"Proc. of ILPS1995","author":"M.H. S\u00f8rensen","year":"1995","unstructured":"S\u00f8rensen, M.H., Gl\u00fcck, R.: An Algorithm of Generalization in Positive Supercompilation. In: Proc. of ILPS1995, pp. 465\u2013479. MIT Press, Cambridge (1995)"}],"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\/11506676_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:26Z","timestamp":1605643406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11506676_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540266556","9783540316831"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11506676_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}