{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T22:40:01Z","timestamp":1710283201669},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1007\/bf03037483","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T03:04:17Z","timestamp":1240542257000},"page":"283-342","source":"Crossref","is-referenced-by-count":15,"title":["Constrained partial deduction and the preservation of characteristic trees"],"prefix":"10.1007","volume":"16","author":[{"given":"Michael","family":"Leuschel","sequence":"first","affiliation":[]},{"given":"Danny","family":"de Schreye","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF03037483_CR1","first-page":"495","volume-title":"Handbook of Theoretical Computer Science","author":"K. R. Apt","year":"1990","unstructured":"Apt, K. R., \u201cIntroduction to Logic Programming,\u201d inHandbook of Theoretical Computer Science (J. van Leeuwen, ed.), North-Holland, Amsterdam, chapter 10, pp. 495\u2013574, 1990."},{"issue":"5","key":"BF03037483_CR2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1093\/logcom\/3.5.469","volume":"3","author":"K. Benkerimi","year":"1993","unstructured":"Benkerimi, K. and Hill, P. M., \u201cSupporting Transformations for the Partial Evaluation of Logic Programs,\u201dJournal of Logic and Computation, 3, 5, pp. 469\u2013486, October 1993.","journal-title":"Journal of Logic and Computation"},{"key":"BF03037483_CR3","unstructured":"Benkerimi, K. and Lloyd, J. W., \u201cA Partial Evaluation Procedure for Logic Programs,\u201d inProceedings of the North American Conference on Logic Programming (S. Debray and M. Hermenegildo, eds.), MIT Press, pp. 343\u2013358, 1990."},{"issue":"1\u20132","key":"BF03037483_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0743-1066(93)90022-9","volume":"16","author":"R. Bol","year":"1993","unstructured":"Bol, R., \u201cLoop Checking in Partial Deduction,\u201dJournal of Logic Programming, 16, 1\u20132, pp. 25\u201346, 1993.","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"BF03037483_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/78942.78947","volume":"12","author":"A. Bossi","year":"1990","unstructured":"Bossi, A., Cocco, N., and Dulli, S., \u201cA Method for Specialising Logic Programs,\u201dACM Transactions on Programming Languages and Systems, 12, 2, pp. 253\u2013302, 1990.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"BF03037483_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03037527","volume":"11","author":"M. Bruynooghe","year":"1992","unstructured":"Bruynooghe, M., De Schreye, D., and Martens, B., \u201cA General Criterion for Avoiding Infinite Unfolding during Partial Deduction,\u201dNew Generation Computing, 11, 1, pp. 47\u201379, 1992.","journal-title":"New Generation Computing"},{"key":"BF03037483_CR7","unstructured":"Chan, D., \u201cConstructive Negation Based on the Completed Database,\u201d inProceedings of the Joint International Conference and Symposium on Logic Programming, Seattle, 1988, IEEE, MIT Press, pp. 111\u2013125, 1988."},{"key":"BF03037483_CR8","unstructured":"Chan, D. and Wallace, M., \u201cA Treatment of Negation during Partial Evaluation,\u201d inMeta-Programming in Logic Programming, Proceedings of the Meta88 Workshop (H. Abramson and M. Rogers, eds.), June 1988, MIT Press, pp. 299\u2013318, 1989."},{"key":"BF03037483_CR9","doi-asserted-by":"crossref","unstructured":"Clark, K. L., \u201cNegation as Failure,\u201d inLogic and Data Bases (H. Gallaire and J. Minker, eds.), Plenum Press, pp. 293\u2013322, 1978.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"BF03037483_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19\u201320","author":"D. Schreye De","year":"1994","unstructured":"De Schreye, D. and Decorte, S., \u201cTermination of Logic Programs: The Never Ending Story,\u201dThe Journal of Logic Programming, 19\u201320, pp. 199\u2013260, May 1994.","journal-title":"The Journal of Logic Programming"},{"key":"BF03037483_CR11","doi-asserted-by":"crossref","unstructured":"de Wall, D. A. and Gallagher, J., \u201cSpecialisation of a Unification Algorithm,\u201d inLogic Program Synthesis and Transformation (T. Clement and K.-K. Lau, eds.),Proceedings of LOPSTR\u201991, Manchester, UK, pp. 205\u2013220, 1991.","DOI":"10.1007\/978-1-4471-3494-7_15"},{"key":"BF03037483_CR12","doi-asserted-by":"crossref","unstructured":"de Waal, D. A. and Gallagher, J., \u201cThe Applicability of Logic Program Analysis and Transformation to Theorem Proving,\u201d inAutomated Deduction \u2014 CADE-12 (A. Bundy, ed.), Springer-Verlag, pp. 207\u2013221, 1994.","DOI":"10.1007\/3-540-58156-1_15"},{"issue":"8","key":"BF03037483_CR13","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N. and Manna, Z., \u201cProving Termination with Multiset Orderings,\u201dCommunications of the ACM, 22, 8, pp. 465\u2013476, 1979.","journal-title":"Communications of the ACM"},{"issue":"5","key":"BF03037483_CR14","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1093\/logcom\/3.5.487","volume":"3","author":"K. Doets","year":"1993","unstructured":"Doets, K., \u201cLevationis laus,\u201dJournal of Logic and Computation, 3, 5, pp. 487\u2013516, 1993.","journal-title":"Journal of Logic and Computation"},{"key":"BF03037483_CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01185404","volume":"32","author":"W. Drabent","year":"1995","unstructured":"Drabent W., \u201cWhat Is Failure? An Apporach to Constructive Negation,\u201dActa Informatica, 32, pp. 27\u201359, 1995.","journal-title":"Acta Informatica"},{"key":"BF03037483_CR16","doi-asserted-by":"crossref","unstructured":"Etalle, S. and Gabbrielli, M., \u201cA Transformation System for Modular CLP Programs,\u201d inProceedings of the 12th International Conference on Logic Programming (L. Sterling, ed.), MIT Press, pp. 681\u2013695, 1995.","DOI":"10.7551\/mitpress\/4298.003.0066"},{"key":"BF03037483_CR17","unstructured":"Gallagher, J., \u201cA System for Specialising Logic Programs,\u201dTechnical Report, TR-91-32, University of Bristol, November 1991."},{"key":"BF03037483_CR18","doi-asserted-by":"crossref","unstructured":"Gallagher, J., \u201cTutorial on Specialisation of Logic Programs,\u201d inProceedings of PEPM\u201993, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, pp. 88\u201398, 1993.","DOI":"10.1145\/154630.154640"},{"key":"BF03037483_CR19","unstructured":"Gallagher, J. and Bruynooghe, M., \u201cSome Low-Level Transformations for Logic Programs,\u201d inProceedings of Meta90 Workshop on Meta Programming in Logic (M. Bruynooghe, ed.), Leuven, Belgium, pp. 229\u2013244, 1990."},{"issue":"3\u20134","key":"BF03037483_CR20","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF03037167","volume":"9","author":"J. Gallagher","year":"1991","unstructured":"Gallagher, J. and Bruynooghe, M., \u201cThe Derivation of an Algorithm for Program Specialisation,\u201dNew Generation Computing, 9, 3\u20134, pp. 305\u2013333, 1991.","journal-title":"New Generation Computing"},{"key":"BF03037483_CR21","doi-asserted-by":"crossref","unstructured":"Gallagher, J. and de Waal, D. A., \u201cDeletion of Redundant Unary Type Predicates from Logic Programs,\u201d inLogic Program Synthesis and Transformation (K.-K. Lau and T. Clement, eds.),Proceedings of LOPSTR\u201992, Manchester, UK, pp. 151\u2013167, 1992.","DOI":"10.1007\/978-1-4471-3560-9_11"},{"key":"BF03037483_CR22","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., J\u00f8rgensen, J., Martens, B. and S\u00f8rensen, M. H., \u201cControlling Conjunctive Partial Deduction of Definite Logic Programs,\u201d inProceedings of the International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP\u201996) LNCS 1140 (H. Kuchen and Swierstra, eds.), Aachen, Germany, September 1996, Springer-Verlag, pp. 152\u2013166, 1996.","DOI":"10.1007\/3-540-61756-6_83"},{"key":"BF03037483_CR23","unstructured":"Hill, P. and Gallagher, J., \u201cMeta-Programming in Logic Programming,\u201dTechnical Report, 94.22, School of Computer Studies, University of Leeds, 1994. To be published inHandbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5, Oxford Science Publications, Oxford University Press."},{"key":"BF03037483_CR24","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\u201320","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J. and Maher, M. J., \u201cConstraint Logic Programming: A Survey,\u201dThe Journal of Logic Programming, 19\u201320, pp. 503\u2013581, 1994.","journal-title":"The Journal of Logic Programming"},{"key":"BF03037483_CR25","unstructured":"Jones, N. D., Gomard, C. K., and Sestoft, P.,Partial Evaluation and Automatic Program Generation, Prentice Hall, 1993."},{"key":"BF03037483_CR26","doi-asserted-by":"crossref","unstructured":"J\u00f8rgensen, J., Leuschel, M., and Martens, B. \u201cConjunctive Partial Deduction in Practice,\u201d inProceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR \u201996), LNCS 1207 (J. Gallagher, ed.), Stockholm, Sweden, August 1996, Springer-Verlag, pp. 59\u201382, 1996. Also in theProceedings of BENELOG\u201996, extended version asTechnical Report, CW 242, K.U. Leuven.","DOI":"10.1007\/3-540-62718-9_5"},{"key":"BF03037483_CR27","unstructured":"Ko, H.-P. and Nadel, M. E., \u201cSubstitution and Refutation Revisited,\u201d inLogic Programming: Proceedings of the Eighth International Conference (K. Furukawa, ed.), MIT Press, pp. 679\u2013692, 1991."},{"key":"BF03037483_CR28","series-title":"Link\u00f6ping Studies in Science and Technology Dissertations","volume-title":"A Specification of an Abstract Prolog Machine and Its Application to Partial Evaluation","author":"J. Komorowksi","year":"1981","unstructured":"Komorowksi, J., \u201cA Specification of an Abstract Prolog Machine and Its Application to Partial Evaluation,\u201dPh.D thesis, Link\u00f6ping University, Sweden, 1981, Link\u00f6ping Studies in Science and Technology Dissertations 69."},{"key":"BF03037483_CR29","doi-asserted-by":"crossref","unstructured":"Komorowski, J., \u201cAn Introduction to Partial Deduction,\u201d inProceedings Meta\u201992, LNCS 649 (A. Pettorossi, ed.), Springer-Verlag, pp. 49\u201369, 1992.","DOI":"10.1007\/3-540-56282-6_4"},{"key":"BF03037483_CR30","doi-asserted-by":"crossref","unstructured":"Kunen, K., \u201cAnswer Sets and Negation as Failure,\u201d inProceedings of the 4th International Conference on Logic Programming, (J.-L. Lassez, ed.), MIT Press, pp. 219\u2013228, 1987.","DOI":"10.1016\/0743-1066(87)90007-0"},{"key":"BF03037483_CR31","series-title":"Technical Report","volume-title":"A Comparative Analysis of Partial Deductors for Pure Prolog","author":"J. Lam","year":"1990","unstructured":"Lam, J. and Kusalik, A., \u201cA Comparative Analysis of Partial Deductors for Pure Prolog\u201dTechnical Report, Department of Computational Science, University of Saskatchewan, Canada, May 1990, Revised April 1991."},{"key":"BF03037483_CR32","doi-asserted-by":"crossref","unstructured":"Lassez, J.-L., Maher, M., and Marriott, K., \u201cUnification Revisited,\u201d inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan-Kaufmann pp. 587\u2013625, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"BF03037483_CR33","doi-asserted-by":"crossref","unstructured":"Leuschel, M., \u201cPartial Evaluation of the \u201cReal Thing\u201d,\u201d, inLogic Program Synthesis and Transformation \u2014 Meta-Programming in Logic (L. Fribourg and F. Turini, eds.),Proceedings of LOPSTR\u201994 and META\u201994, LNCS 883, Pisa, Italy, June 1994. Springer-Verlag, pp. 122\u2013137, 1994.","DOI":"10.1007\/3-540-58792-6_8"},{"key":"BF03037483_CR34","doi-asserted-by":"crossref","unstructured":"Leuschel, M., \u201cEcological Partial Deduction: Preserving Characteristic Trees without Constraints,\u201d inLogic Program Synthesis and Transformation (M. Proietti, ed.),Proceedings of LOPSTR\u201995, LNCS 1048, Utrecht, Netherlands, September 1995, Springer-Verlag, pp. 1\u201316, 1995.","DOI":"10.1007\/3-540-60939-3_1"},{"key":"BF03037483_CR35","unstructured":"Leuschel, M., \u201cAdvanced Techniques for Logic Program Specialisation,\u201dPh.D. thesis, K.U. Leuven, May 1997. Available at http:\/\/www.cs.kuleuven.ac.be\/\u223cmichael."},{"key":"BF03037483_CR36","series-title":"Technical Report, CW","volume-title":"An Almost Perfect Abstraction Operation for Partial Deduction","author":"M. Leuschel","year":"1994","unstructured":"Leuschel, M. and De Schreye, D., \u201cAn Almost Perfect Abstraction Operation for Partial Deduction,\u201dTechnical Report, CW 199, Departement Computerwetenschappen, K.U. Leuven, Belgium, December 1994."},{"key":"BF03037483_CR37","series-title":"Technical Report, CW","volume-title":"An Almost Perfect Abstraction Operation for Partial Deduction Using Characteristic Trees","author":"M. Leuschel","year":"1995","unstructured":"Leuschel, M. and De Schreye, D., \u201cAn Almost Perfect Abstraction Operation for Partial Deduction Using Characteristic Trees,\u201dTechnical Report, CW 215, Departement Computerwetenschappen, K.U. Leuven, Belgium, October 1995."},{"key":"BF03037483_CR38","doi-asserted-by":"crossref","unstructured":"Leuschel, M. and De Schreye, D., \u201cTowards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters,\u201d inProceedings of PEPM\u201995, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, La Jolla, California, June 1995, ACM Press, pp. 253\u2013263, 1995.","DOI":"10.1145\/215465.215598"},{"key":"BF03037483_CR39","unstructured":"Leuschel, M., De Schreye, D., and de Waal, A., \u201cA Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration,\u201d inProceedings of the Joint International Conference and Symposium on Logic Programming JICSLP\u201996 (M. Maher, ed.), Bonn, Germany, September 1996, MIT Press, pp. 319\u2013332, 1996. Extended version asTechnical Report, CW 225, K.U. Leuven. Available at http:\/\/www.cs. kuleuven.ac.be\/\u223clpai."},{"key":"BF03037483_CR40","doi-asserted-by":"crossref","unstructured":"Leuschel, M. and Martens, B., \u201cGlobal Control for Partial Deduction through Characteristic Atoms and Global Trees,\u201d inProceedings of the 1996 Dagstuhl Seminar on Partial Evaluation (O. Danvy, R. Gl\u00fcck, and P. Thiemann, eds.),LNCS 1110, Schlo\u00df Dagstuhl, 1996, Springer-Verlag, pp. 263\u2013283, 1996. Extended version as Technical Report, CW 220, K. U. Leuven. Available at http:\/\/www.cs.kuleuven.ac.be\/\u223clpai.","DOI":"10.1007\/3-540-61580-6_13"},{"key":"BF03037483_CR41","doi-asserted-by":"crossref","unstructured":"Leuschel, M. and S\u00f8rensen, M. H., \u201cRedundant Argument Filtering of Logic Programs,\u201d inProceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR\u201996), LNCS 1207, (J. Gallagher, ed.), Stockholm, Sweden, August 1996, Springer-Verlag, pp. 83\u2013103, 1996. Extended version asTechnical Report, CW 243, K. U. Leuven.","DOI":"10.1007\/3-540-62718-9_6"},{"key":"BF03037483_CR42","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W.,Foundations of Logic Programming, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"3\u20134","key":"BF03037483_CR43","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. W. Lloyd","year":"1991","unstructured":"Lloyd, J. W. and Shepherdson, J. C., \u201cPartial Evaluation in Logic Programming,\u201dJournal of Logic Programming, 11, 3\u20134, pp. 217\u2013242, 1991.","journal-title":"Journal of Logic Programming"},{"key":"BF03037483_CR44","unstructured":"Maher, M., \u201cA Logic Programming View of CLP,\u201d inProceedings of the 10th International Conference on Logic Programming (D. S. Warren, ed.), MIT Press, pp. 737\u2013753, 1993."},{"key":"BF03037483_CR45","unstructured":"Maluszy\u0144ski, J. and N\u00e4slund, T., \u201cFail Substitutions for Negation as Failure,\u201d inLogic Programming: Proceedings of the North American Conference, (E. L. Lusk and R. A. Overbeek, eds.), MIT Press, pp. 461\u2013476, 1989."},{"key":"BF03037483_CR46","unstructured":"Martens, B., \u201cOn the Semantics of Meta-Programming and the Control of Partial Deduction in Logic Programming,\u201dPh.D. thesis, K.U. Leuven, February 1994."},{"key":"BF03037483_CR47","unstructured":"Martens, B. and De Schreye, D., \u201cTwo Semantics for Definite Meta-Programs, Using the Non-Ground Representation,\u201d inMeta-logics and Logic Programming (K. R. Apt and F. Turini, eds.), MIT Press, pp. 57\u201382, 1995."},{"issue":"1","key":"BF03037483_CR48","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0743-1066(94)00015-X","volume":"22","author":"B. Martens","year":"1995","unstructured":"Martens, B. and De Schreye, D., \u201cWhy Untyped Non-Ground Meta-Pogramming Is Not (Much of) a Problem,\u201dJournal of Logic Programming, 22, 1, pp. 47\u201399, 1995.","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"BF03037483_CR49","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0743-1066(95)00149-2","volume":"28","author":"B. Martens","year":"1996","unstructured":"Martens, B. and De Schreye, D., \u201cAutomatic Finite Unfolding Using Well-Founded Measures,\u201dJournal of Logic Programming, 28, 2, pp. 89\u2013146, August 1996.","journal-title":"Journal of Logic Programming"},{"issue":"1\u20132","key":"BF03037483_CR50","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(94)90203-8","volume":"122","author":"B. Martens","year":"1994","unstructured":"Martens, B., De Schreye, D., and Horv\u00e1th, T., \u201cSound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures,\u201dTheoretical Computer Science, 122, 1\u20132, pp. 97\u2013117, 1994.","journal-title":"Theoretical Computer Science"},{"key":"BF03037483_CR51","doi-asserted-by":"crossref","unstructured":"Martens, B. and Gallagher, J., \u201cEnsuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance,\u201d inProceedings ICLP\u201995 (L. Sterling, ed.), Kanagawa, Japan, June 1995, MIT Press, pp. 597\u2013613, 1995. Extended version asTechnical Report, CSTR-94-16, University of Bristol.","DOI":"10.7551\/mitpress\/4298.003.0059"},{"key":"BF03037483_CR52","unstructured":"Owen, S., \u201cIssues in the Partial Evaluation of Meta-Interpreters,\u201d inMeta-Programming in Logic Programming, Proceedings of the Meta88 Workshop (H. Abramson and M. Rogers, eds.), June 1988, MIT Press, pp. 319\u2013339, 1989."},{"key":"BF03037483_CR53","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19\u201320","author":"A. Pettorossi","year":"1994","unstructured":"Pettorossi, A. and Proietti, M., \u201cTransformation of Logic Programs: Foundations and Techniques,\u201dJournal of Logic Programming, 19\u201320, pp. 261\u2013320, May 1994.","journal-title":"Journal of Logic Programming"},{"issue":"1\u20132","key":"BF03037483_CR54","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0743-1066(93)90025-C","volume":"16","author":"M. Proietti","year":"1993","unstructured":"Proietti, M. and Pettorossi, A., \u201cThe Loop Absorption and the Generalization Strategies for the Development of Logic Programs and Partial Deduction,\u201dJournal of Logic Programming, 16, 1\u20132, pp. 123\u2013162, May 1993.","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"BF03037483_CR55","first-page":"167","volume":"5","author":"T. C. Przymusinksi","year":"1989","unstructured":"Przymusinksi, T. C., \u201cOn the Declarative and Procedural Semantics of Logic Programs,\u201dJournal of Automated Reasoning, 5, 2, pp. 167\u2013205, 1989.","journal-title":"Journal of Automated Reasoning"},{"key":"BF03037483_CR56","doi-asserted-by":"crossref","unstructured":"Puebla, G. and Hermenegildo, M., \u201cImplementation of Multiple Specialization in Logic Programs,\u201d inProceedings of PEPM\u201995, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, La Jolla, California, June 1995, ACM Press, pp. 77\u201387, 1995.","DOI":"10.1145\/215465.215561"},{"key":"BF03037483_CR57","unstructured":"Sahlin, D., \u201cAn Automatic Partial Evaluator for Full Prolog,\u201dPh.D. thesis, Swedish Institute of Computer Science, March 1991."},{"issue":"1","key":"BF03037483_CR58","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF03038271","volume":"12","author":"D. Sahlin","year":"1993","unstructured":"Sahlin, D., \u201cMixtus: An Automatic Partial Evaluator for Full Prolog,\u201dNew Generation Computing, 12, 1, pp. 7\u201351, 1993.","journal-title":"New Generation Computing"},{"key":"BF03037483_CR59","unstructured":"Shepherdson, J. C., \u201cLanguage and Equality Theory in Logic Programming,\u201dTechnical Report, PM-91-02, University of Bristol, 1991."},{"key":"BF03037483_CR60","unstructured":"Smith, D. A., \u201cConstraint Operations for CLP (FT),\u201d inLogic Programming: Proceedings of the Eighth International Conference (K. Furukawa, ed.), MIT Press, pp. 760\u2013774, 1991."},{"key":"BF03037483_CR61","doi-asserted-by":"crossref","unstructured":"Smith, D. A., \u201cPartial Evaluation of Pattern Matching in Constraint Logic Programming Languages,\u201d inACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press Sigplan Notices 26, 9 (N. D. Jones and P. Hudak, eds.), pp. 62\u201371, 1991.","DOI":"10.1145\/115865.115873"},{"key":"BF03037483_CR62","unstructured":"Smith, D. A. and Hickey, T., \u201cPartial Evaluation of a CLP Language,\u201d inProceedings of the North American Conference on Logic Programming (S. Debray and M. Hermenegildo, eds.), MIT Press, pp. 119\u2013138, 1990."},{"key":"BF03037483_CR63","unstructured":"S\u00f8rensen, M. H. and Gl\u00fcck, R., \u201cAn Algorithm of Generalization in Positive Supercompilation,\u201d inProceedings of ILPS\u201995 (J. W. Lloyd, ed.), the International Logic Programming Symposium, Portland, USA, December 1995, MIT Press, pp. 465\u2013479, 1995."},{"issue":"1\u20132","key":"BF03037483_CR64","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0743-1066(89)90034-4","volume":"6","author":"L. Sterling","year":"1989","unstructured":"Sterling, L. and Beer, R. D., \u201cMetainterpreters for Expert System Construction,\u201dJournal of Logic Programming, 6, 1\u20132, pp. 163\u2013178, 1989.","journal-title":"Journal of Logic Programming"},{"key":"BF03037483_CR65","doi-asserted-by":"crossref","unstructured":"Stuckey, P. J., \u201cConstructive Negation for Constraint Logic Programming,\u201d inProceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, Amesterdam, Netherlands, July 1991, IEEE Computer Society Press, pp. 328\u2013339, 1991.","DOI":"10.1109\/LICS.1991.151657"},{"issue":"1","key":"BF03037483_CR66","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1006\/inco.1995.1048","volume":"118","author":"P. J. Stuckey","year":"1995","unstructured":"Stuckey, P. J., \u201cNegation and Constraint Logic Programming,\u201dInformation and Computation, 118, 1, pp. 12\u201333, April 1995.","journal-title":"Information and Computation"},{"issue":"3","key":"BF03037483_CR67","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"V. F. Turchin","year":"1986","unstructured":"Turchin, V. F., \u201cThe Concept of a Supercompiler,\u201dACM Transactions on Programming Languages and Systems, 8, 3, pp. 292\u2013325, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"BF03037483_CR68","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1017\/S0956796800000757","volume":"3","author":"V. F. Turchin","year":"1993","unstructured":"Turchin, V. F., \u201cProgram Transformation with Metasystem Transitions,\u201dJournal of Functional Programming, 3, 3, pp. 283\u2013313, 1993.","journal-title":"Journal of Functional Programming"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037483.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037483\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T22:01:53Z","timestamp":1710280913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":68,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["BF03037483"],"URL":"https:\/\/doi.org\/10.1007\/bf03037483","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}