{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:32:19Z","timestamp":1761597139860},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["NGCO"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1007\/bf03037257","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T02:04:17Z","timestamp":1240365857000},"page":"3-26","source":"Crossref","is-referenced-by-count":36,"title":["The narrowing-driven approach to functional logic program specialization"],"prefix":"10.1007","volume":"20","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"German","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,1]]},"reference":[{"key":"BF03037257_CR1","first-page":"187","volume-title":"Lecture Notes in Computer Science","author":"Sergei Abramov","year":"2000","unstructured":"Abramov, S. and Gl\u00fcck, R., \u201cThe Universal Resolving Algorithm: Inverse Computation in a Functional Language,\u201d inProc. of the 5th Int\u2019l Conf. on Mathematics of Program Construction, Springer LNCS 1837, pp. 187\u2013212, 2000."},{"key":"BF03037257_CR2","unstructured":"Albert, E., \u201cPartial Evaluation of Multi-Paradigm Declarative Languages: Foundations, Control, Algorithms and Efficiency,\u201d Ph.D. thesis, DSIC, Universidad Polit\u00e9cnica de Valencia, 2001. Available from URL: http:\/\/www.dsic.upv.es\/users\/elp\/papers.html."},{"key":"BF03037257_CR3","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-49727-7_16","volume-title":"Static Analysis","author":"E. Albert","year":"1998","unstructured":"Albert, E., Alpuente, M., Falaschi, M., Juli\u00e1n, P. and Vidal, G., \u201cImproving Control in Functional Logic Program Specialization,\u201d inProc. of the 5th Int\u2019l Static Analysis Symposium (SAS\u201998), Springer LNCS 1503, pp. 262\u2013277, 1998."},{"key":"BF03037257_CR4","doi-asserted-by":"crossref","unstructured":"Albert, E., Alpuente, M., Hanus, M. and Vidal, G., \u201cA Partial Evaluation Framework for Curry Programs,\u201d inProc. of the 6th Int\u2019l Conf. on Logic Programming and Automated Reasoning (LPAR\u201999), Springer LNAI 1705, pp. 376\u2013395, 1999.","DOI":"10.1007\/3-540-48242-3_23"},{"key":"BF03037257_CR5","doi-asserted-by":"crossref","unstructured":"Albert, E., Antoy, S. and Vidal, G., \u201cMeasuring the Effectiveness of Partial Evaluation in Functional Logic Languages,\u201d inProc. of the 10th Int\u2019l Workshop on Logic-Based Program Synthesis and Transformation (LOPSTR\u20192000), Springer LNCS 2042, pp. 103\u2013124, 2001.","DOI":"10.1007\/3-540-45142-0_7"},{"key":"BF03037257_CR6","doi-asserted-by":"crossref","unstructured":"Albert, E., Hanus, M. and Vidal, G., \u201cUsing an Abstract Representation to Specialize Functional Logic Programs,\u201d inProc. of the 7th Int\u2019l Conf. on Logic for Programming and Automated Reasoning (LPAR\u20192000), Springer LNAI 1955, pp. 381\u2013398, 2000.","DOI":"10.1007\/3-540-44404-1_24"},{"key":"BF03037257_CR7","doi-asserted-by":"crossref","unstructured":"Albert, E., Hanus, M. and Vidal, G., \u201cA Practical Partial Evaluator, for a Multi-Paradigm Declarative Language,\u201d inProc. of the 4th Fuji Int\u2019l Symp. on Functional and Logic Programming (FLOPS\u20192001), Springer LNCS 2024, pp. 326\u2013342, 2001.","DOI":"10.1007\/3-540-44716-4_21"},{"issue":"12","key":"BF03037257_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/258994.259015","volume":"32","author":"M. Alpuente","year":"1997","unstructured":"Alpuente, M., Falaschi, M., Juli\u00e1n, P. and Vidal, G., \u201cSpecialization of Lazy Functional Logic Programs,\u201d inProc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM\u201997) Sigplan Notices, 32, 12, ACM Press, pp. 151\u2013162, 1997.","journal-title":"ACM SIGPLAN Notices"},{"key":"BF03037257_CR9","doi-asserted-by":"crossref","unstructured":"Alpuente, M., Falaschi, M. and Vidal, G., \u201cNarrowing-driven Partial Evaluation of Functional Logic Programs,\u201d inProc. of the 6th European Symposium on Programming (ESOP\u201996), Springer LNCS 1058, pp. 45\u201361, 1996.","DOI":"10.1007\/3-540-61055-3_28"},{"issue":"4","key":"BF03037257_CR10","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1145\/291891.291896","volume":"20","author":"M. Alpuente","year":"1998","unstructured":"Alpuente, M., Falaschi, M. and Vidal, G., \u201cPartial Evaluation of Functional Logic Programs,\u201dACM Transactions on Programming Languages and Systems, 20, 4, pp. 768\u2013844, 1998.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"9","key":"BF03037257_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/317765.317910","volume":"34","author":"Mar\u00eda Alpuente","year":"1999","unstructured":"Alpuente M., Hanus M., Lucas S. and Vidal, G., \u201cSpecialization of Inductively Sequential Functional Logic Programs,\u201d inProc. of the 4th ACM SIGPLAN Int\u2019l Conf. on Functional Programming (ICFP\u201999), 34, 9 ofSigplan Notices, ACM Press, pp. 273\u2013283, 1999.","journal-title":"ACM SIGPLAN Notices"},{"key":"BF03037257_CR12","doi-asserted-by":"crossref","unstructured":"Antoy, S., \u201cDefinitional Trees,\u201d inProc. of the 3rd Int\u2019l Conf. on Algebraic and Logic Programming (ALP\u201992), Springer LNCS 632, pp. 143\u2013157, 1992.","DOI":"10.1007\/BFb0013825"},{"issue":"4","key":"BF03037257_CR13","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S. Antoy","year":"2000","unstructured":"Antoy, S., Echahed, R. and Hanus, M., \u201cA Needed Narrowing Strategy,\u201dJournal of the ACM, 47, 4, pp. 776\u2013822, 2000.","journal-title":"Journal of the ACM"},{"key":"BF03037257_CR14","doi-asserted-by":"crossref","unstructured":"Baader, F. and Nipkow, T.,Term Rewriting and All That, Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"issue":"1&2","key":"BF03037257_CR15","doi-asserted-by":"publisher","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&2, pp. 25\u201346, 1993.","journal-title":"Journal of Logic Programming"},{"key":"BF03037257_CR16","doi-asserted-by":"crossref","unstructured":"Bondorf, A., \u201cA Self-Applicable Partial Evaluator for Term Rewriting Systems,\u201d inProc. of the Int\u2019l Joint Conf. on Theory and Practice of Software Development (TAP-SOFT\u201989), Springer LNCS 352, pp. 81\u201395, 1989.","DOI":"10.1007\/3-540-50940-2_29"},{"issue":"1","key":"BF03037257_CR17","doi-asserted-by":"publisher","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,\u201dNew Generation Computing, 11, 1, pp. 47\u201379, 1992.","journal-title":"New Generation Computing"},{"issue":"1","key":"BF03037257_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R. Burstall","year":"1977","unstructured":"Burstall, R. and Darlington, J., \u201cA Transformation System for Developing Recursive Programs,\u201dJournal of the ACM, 24, 1, pp. 44\u201367, 1977.","journal-title":"Journal of the ACM"},{"key":"BF03037257_CR19","doi-asserted-by":"crossref","unstructured":"Consel, C. and Danvy, O., \u201cTutorial Notes on Partial Evaluation,\u201d inProc. of the 20th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL\u201993), ACM Press, pp. 493\u2013501, 1993.","DOI":"10.1145\/158511.158707"},{"key":"BF03037257_CR20","unstructured":"Darlington, J. and Pull, H., \u201cA Program Development Methodology Based on a Unified Approach to Execution and Transformation,\u201d inProc. of the IFIP TC2 Workshop on Partial Evaluation and Mixed Computation, North-Holland, pp. 117\u2013131, 1988."},{"issue":"2&3","key":"BF03037257_CR21","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0743-1066(99)00030-8","volume":"41","author":"D. Schreye De","year":"1999","unstructured":"De Schreye, D., Gl\u00fcck, R., J\u00f8rgensen, J., Leuschel, M., Martens, B. and S\u00f8rensen, M., \u201cConjunctive Partial Deduction: Foundations, Control, Algorihtms, and Experiments,\u201dJournal of Logic Programming, 41, 2&3, pp. 231\u2013277, 1999.","journal-title":"Journal of Logic Programming"},{"key":"BF03037257_CR22","doi-asserted-by":"crossref","unstructured":"Etalle, S., Gabbrielli, M. and Marchiori, E., \u201cA Transformation System for CLP with Dynamic Scheduling and CCP,\u201d inProc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM\u201997), volume 32, 12 ofSigplan Notices, ACM Press, pp. 137\u2013150, 1997.","DOI":"10.1145\/258994.259014"},{"key":"BF03037257_CR23","unstructured":"Fribourg, L., \u201cSLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting,\u201d inProc. of the 2nd IEEE Int\u2019l Symp. on Logic Programming, IEEE Press, pp. 172\u2013185, 1985."},{"issue":"4","key":"BF03037257_CR24","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1023\/A:1010095604496","volume":"12","author":"Y. Futamura","year":"1999","unstructured":"Futamura, Y., \u201cPartial Evaluation of Computation Process\u2014An Approach to a Compiler-Compiler,\u201dHigher-Order and Symbolic Computation, 12, 4, pp. 381\u2013391, 1999. Reprint of article inSystems, Computers, Controls 1971.","journal-title":"Higher-Order and Symbolic Computation"},{"key":"BF03037257_CR25","doi-asserted-by":"crossref","unstructured":"Gallagher, J., \u201cTutorial on Specialisation of Logic Programs,\u201d inProc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM\u201993), pp. 88\u201398, ACM Press, 1993.","DOI":"10.1145\/154630.154640"},{"key":"BF03037257_CR26","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0022-0000(91)90009-T","volume":"42","author":"E. Giovannetti","year":"1991","unstructured":"Giovannetti, E., Levi, G., Moiso, C. and Palamidessi, C., \u201cKernel Leaf: A Logic plus Functional Language,\u201dJournal of Computer and System Sciences, 42, pp. 363\u2013377, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF03037257_CR27","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R. and Klimov, A., \u201cOccam\u2019s Razor in Metacomputation: the Notion of a Perfect Process Tree,\u201d inProc. of the 3rd Int\u2019l Workshop on Static Analysis, Springer LNCS 724, pp. 112\u2013123, 1993.","DOI":"10.1007\/3-540-57264-3_34"},{"key":"BF03037257_CR28","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R. and S\u00f8rensen, M., \u201cPartial Deduction and Driving are Equivalent,\u201d inProc. of the 6th Int\u2019l Symp. on Programming Language Implementation and Logic Programming (PLILP\u201994), Springer LNCS 844, pp. 165\u2013181, 1994.","DOI":"10.1007\/3-540-58402-1_13"},{"key":"BF03037257_CR29","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19&20","author":"M. Hanus","year":"1994","unstructured":"Hanus, M., \u201cThe Integration of Functions into Logic Programming: From Theory to Practice,\u201dJournal of Logic Programming, 19&20, pp. 583\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"BF03037257_CR30","doi-asserted-by":"crossref","unstructured":"Hanus, M., \u201cA Unified Computation Model for Functional and Logic Programming,\u201d inProc. of 24th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL\u201997), ACM Press, pp. 80\u201393, 1997.","DOI":"10.1145\/263699.263710"},{"key":"BF03037257_CR31","series-title":"Technical report","volume-title":"PAKCS 1.2: The Portland Aachen Kiel Curry System User Manual","author":"M. Hanus","year":"2000","unstructured":"Hanus, M., Antoy, S., Koj, J., Sadre, R. and Steiner, F., \u201cPAKCS 1.2: The Portland Aachen Kiel Curry System User Manual,\u201d Technical report, University of Kiel, Germany, 2000."},{"issue":"1","key":"BF03037257_CR32","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1017\/S0956796899003330","volume":"9","author":"M. Hanus","year":"1999","unstructured":"Hanus, M. and Prehofer, C., \u201cHigher-Order Narrowing with Definitional Trees,\u201dJournal of Functional Programming, 9, 1, pp. 33\u201375, 1999.","journal-title":"Journal of Functional Programming"},{"key":"BF03037257_CR33","unstructured":"\u201cCurry: An Integrated Functional Logic Language,\u201d (Hanus, M., ed.) Available at http:\/\/www.informatik.uni-kiel.de\/~curry\/report.html, 2000."},{"key":"BF03037257_CR34","doi-asserted-by":"crossref","unstructured":"Hortal\u00e1-Gonz\u00e1lez, T. and Ull\u00e1n, E., \u201cAn Abstract Machine Based System for a Lazy Narrowing Calculus,\u201d inProc. of the 4th Fuji Int\u2019l Symp. on Functional and Logic Programming (FLOPS\u20192001), pp. 216\u2013232, Springer LNCS 2024, 2001.","DOI":"10.1007\/3-540-44716-4_14"},{"key":"BF03037257_CR35","unstructured":"Huet, G. and L\u00e9vy, J., \u201cComputations in Orthogonal Rewriting Systems, Part I+II,\u201d, inComputational Logic\u2014Essays in Honor of Alan Robinson (J. Lassez and G. Plotkin, eds.), pp. 395\u2013443, 1992."},{"key":"BF03037257_CR36","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"5th Conference on Automated Deduction Les Arcs, France, July 8\u201311, 1980","author":"Jean-Marie Hullot","year":"1980","unstructured":"Hullot, J., \u201cCanonical Forms and Unification,\u201d inProc. of the 5th Int\u2019l Conf. on Automated Deduction, Springer LNCS 87, pp. 318\u2013334, 1980."},{"issue":"1","key":"BF03037257_CR37","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01806312","volume":"2","author":"N. Jones","year":"1989","unstructured":"Jones, N., Sestoft, P. and S\u00f8ndergaard, H., \u201cMix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation,\u201dLisp and Symbolic Computation, 2, 1, pp. 9\u201350, 1989.","journal-title":"Lisp and Symbolic Computation"},{"key":"BF03037257_CR38","unstructured":"Juli\u00e1n-Iranzo, P.,Specialization of Lazy Functional Logic Programs, Ph.D. thesis, DSIC, Universidad Polit\u00e9cnica de Valencia May 2000. In Spanish."},{"key":"BF03037257_CR39","unstructured":"Klop, J., \u201cTerm Rewriting Systems,\u201d inHandbook of Logic in Computer Science (S. Abramsky, D. Gabbay, and T. Maibaum, eds.), I, Oxford University Press, pp. 1\u2013112, 1992."},{"key":"BF03037257_CR40","first-page":"210","volume":"95","author":"J. Kruskal","year":"1960","unstructured":"Kruskal, J., \u201cWell-quasi-ordering, the Tree Theorem, and Vazsonyi\u2019s Conjecture,\u201dTransactions of the American Mathematical Society, 95, pp. 210\u2013225, 1960.","journal-title":"Transactions of the American Mathematical Society"},{"key":"BF03037257_CR41","series-title":"Technical Report CSTR-97-001","volume-title":"Partial Evaluation of Functional Logic Programs in Rewriting-based Languages","author":"L. Lafave","year":"1997","unstructured":"Lafave, L. and Gallagher, J., \u201cPartial Evaluation of Functional Logic Programs in Rewriting-based Languages,\u201d Technical Report CSTR-97-001, Department of Computer Science, University of Bristol, England, March 1997."},{"key":"BF03037257_CR42","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J.L. Lassez","year":"1988","unstructured":"Lassez, J.L., Maher, M.J. and Marriott, K., \u201cUnification Revisited,\u201d inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann, Los Altos, Ca., pp. 587\u2013625, 1988."},{"key":"BF03037257_CR43","doi-asserted-by":"crossref","unstructured":"Leuschel, M., \u201cOn the Power of Homeomorphic Embedding for Online Termination,\u201d inProc. of the 5th Int\u2019l Static Analysis Symposium (SAS\u201998), Springer LNCS 1503, pp. 230\u2013245, 1998.","DOI":"10.1007\/3-540-49727-7_14"},{"key":"BF03037257_CR44","first-page":"319","volume-title":"Proc. of the 1996 Joint Int\u2019l Conf. and Symp. on Logic Programming","author":"M. Leuschel","year":"1996","unstructured":"Leuschel, M., de Schreye, D. and de Waal, A., \u201cA Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration,\u201d inProc. of the 1996 Joint Int\u2019l Conf. and Symp. on Logic Programming, The MIT Press, Cambridge, MA, pp. 319\u2013332, 1996."},{"issue":"1","key":"BF03037257_CR45","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/271510.271525","volume":"20","author":"M. Leuschel","year":"1998","unstructured":"Leuschel, M., Martens, B. and de Schreye, D., \u201cControlling Generalization and Polyvariance in Partial Deduction of Normal Logic Programs\u201d,ACM Transactions on Programming Languages and Systems, 20, 1, pp. 208\u2013258., 1998.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF03037257_CR46","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. Lloyd","year":"1991","unstructured":"Lloyd, J. and Shepherdson, J., \u201cPartial Evaluation in Logic Programming\u201d,Journal of Logic Programming, 11, pp. 217\u2013242, 1991.","journal-title":"Journal of Logic Programming"},{"key":"BF03037257_CR47","doi-asserted-by":"crossref","unstructured":"Loogen, R., L\u00f3pez-Fraguas, F. and Rodr\u00edguez-Artalejo, M., \u201cA Demand Driven Computation Strategy for Lazy Narrowing\u201d, inProc. of the 5th Int\u2019l Symp. on Programming Language Implementation and Logic Programming (PLILP\u201993), Springer LNCS 714, pp. 184\u2013200, 1993.","DOI":"10.1007\/3-540-57186-8_79"},{"key":"BF03037257_CR48","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48685-2_19","volume-title":"Rewriting Techniques and Applications","author":"F. J. L\u00f3pez Fraguas","year":"1999","unstructured":"L\u00f3pez-Fraguas, F. and S\u00e1nchez-Hern\u00e1ndez, J., \u201cTOY: A Multiparadigm Declarative System,\u201d inProc. of the 10th Int\u2019l Conf. on Rewriting Techniques and Applications (RTA\u2019 99), Springer LNCS 1631, pp. 244\u2013247, 1999."},{"key":"BF03037257_CR49","first-page":"390","volume-title":"Informatik aktuell","author":"Wolfgang Lux","year":"1999","unstructured":"Lux, W. and Kuchen, H., \u201cAn Efficient Abstract Machine for Curry,\u201d inProc. of the 8th Int\u2019l Workshop on Functional and Logic Programming (WFLP\u201999), pp. 171\u2013181, 1999."},{"key":"BF03037257_CR50","doi-asserted-by":"crossref","unstructured":"Martens, B. and Gallagher, J., \u201cEnsuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance,\u201d inProc. of the 12th Int\u2019l Conf. on Logic Programming (ICLP\u201995), The MIT Press, pp. 597\u2013611, 1995.","DOI":"10.7551\/mitpress\/4298.003.0059"},{"issue":"3","key":"BF03037257_CR51","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0743-1066(92)90024-W","volume":"12","author":"J. Moreno-Navarro","year":"1992","unstructured":"Moreno-Navarro, J. and Rodr\u00edguez-Artalejo, M., \u201cLogic Programming with Functions and Predicates: The Language Babel,\u201dJournal of Logic Programming, 12, 3, pp. 191\u2013224, 1992.","journal-title":"Journal of Logic Programming"},{"key":"BF03037257_CR52","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/3-540-61580-6_16","volume-title":"Partial Evaluation","author":"Andrei P. Nemytykh","year":"1996","unstructured":"Nemytykh, A., Pinchuk, V. and Turchin, V., \u201cA Self-Applicable Supercompiler,\u201d inPartial Evaluation, Proceedings, Springer LNCS 1110, pp. 322\u2013337, 1996."},{"key":"BF03037257_CR53","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-61580-6_18","volume-title":"Partial Evaluation","author":"Alberto Pettorossi","year":"1996","unstructured":"Pettorossi, A. and Proietti, M., \u201cA Comparative Revisitation of Some Program Transformation Techniques\u201d, inPartial Evaluation. Proceedings, Springer LNCS 1110, pp. 355\u2013385, 1996."},{"key":"BF03037257_CR54","unstructured":"Plasmeijer, R. and Eekelen, M.,Functional Programming and Parallel Graph Rewriting, Addison Wesley, 1993."},{"key":"BF03037257_CR55","unstructured":"Reddy, U.S., \u201cNarrowing as the Operational Semantics of Functional Languages,\u201d inProc. of the 2nd IEEE Int\u2019l Symp. on Logic Programmin, IEEE, New York, pp. 138\u2013151, 1985."},{"issue":"4","key":"BF03037257_CR56","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J. Slagle","year":"1974","unstructured":"Slagle, J., \u201cAutomated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity,\u201dJournal of the ACM, 21, 4, pp. 622\u2013642, 1974.","journal-title":"Journal of the ACM"},{"key":"BF03037257_CR57","series-title":"Technical Report","volume-title":"Turchin\u2019s Supercompiler Revisited: An Operational Theory of Positive Information Propagation","author":"M. S\u00f8rensen","year":"1994","unstructured":"S\u00f8rensen, M., \u201cTurchin\u2019s Supercompiler Revisited: An Operational Theory of Positive Information Propagation,\u201d Technical Report 94\/7, Master\u2019s Thesis, DIKU, University of Copenhagen, Denmark, 1994."},{"key":"BF03037257_CR58","unstructured":"S\u00f8rensen, M. and Gl\u00fcck, R., \u201cAn Algorithm of Generalization in Positive Supercompilation,\u201d inProc. of the 1995 Int\u2019l Logic Programming Symposium (ILPS\u201995), The MIT Press, pp. 465\u2013479, 1995."},{"issue":"6","key":"BF03037257_CR59","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"M. S\u00f8rensen","year":"1996","unstructured":"S\u00f8rensen, M., Gl\u00fcck, R. and Jones, N., \u201cA Positive Supercompiler,\u201dJournal of Functional Programming, 6, 6, pp. 811\u2013838, 1996.","journal-title":"Journal of Functional Programming"},{"issue":"3","key":"BF03037257_CR60","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"V. Turchin","year":"1986","unstructured":"Turchin, V., \u201cThe Concept of a Supercompiler,\u201dACM Transactions on Programming Languages and Systems, 8, 3, pp. 292\u2013325, July 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF03037257_CR61","unstructured":"Vidal, G.,Semantics-Based Analysis and Transformation of Functional Logic Programs, Ph.D. thesis, DSIC, Universidad Polit\u00e9cnica de Valencia, Sept. 1996. In Spanish."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037257.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037257\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037257.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T20:18:31Z","timestamp":1710274711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["BF03037257"],"URL":"https:\/\/doi.org\/10.1007\/bf03037257","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}