{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:47:45Z","timestamp":1762458465066},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634591"},{"type":"electronic","value":"9783540695554"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0026999","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:34:01Z","timestamp":1132396441000},"page":"1-15","source":"Crossref","is-referenced-by-count":8,"title":["Safe folding\/unfolding with conditional narrowing"],"prefix":"10.1007","author":[{"given":"M.","family":"Alpuente","sequence":"first","affiliation":[]},{"given":"M.","family":"Falaschi","sequence":"additional","affiliation":[]},{"given":"G.","family":"Moreno","sequence":"additional","affiliation":[]},{"given":"G.","family":"Vidal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"M. Alpuente, M. Falaschi, G. Moreno, and G. Vidal. Safe Folding\/Unfolding with Conditional Narrowing. Technical Report DSIC-II\/3\/97, DSIC, UPV, 1997.","DOI":"10.1007\/BFb0026999"},{"key":"1_CR2","first-page":"171","volume-title":"Proc. of 6th Int'l Conf. on Computer Languages, ICCL'94","author":"M. Alpuente","year":"1994","unstructured":"M. Alpuente, M. Falaschi, M.J. Ramis, and G. Vidal. A Compositional Semantics for Conditional Term Rewriting Systems. In H.E. Bal, editor, Proc. of 6th Int'l Conf. on Computer Languages, ICCL'94, pages 171\u2013182. IEEE, New York, 1994."},{"issue":"1","key":"1_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(96)00043-6","volume":"165","author":"M. Alpuente","year":"1996","unstructured":"M. Alpuente, M. Falaschi, and G. Vidai. A Compositional Semantic Basis for the Analysis of Equational Horn Programs. Theoretical Computer Science, 165(1):97\u2013131, 1996.","journal-title":"Theoretical Computer Science"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"M. Alpuente, M. Falaschi, and G. Vidal. Partial Evaluation of Functional Logic Programs. Technical Report DSIC-II\/33\/96, DSIC, UPV, 1996. Short version in Proc. of ESOP'96, Springer LNCS 1058, pages 45\u201361. Also available from URL: http:\/\/www.dsic.upv.es\/users\/elp\/papers.html.","DOI":"10.1007\/3-540-61055-3_28"},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(88)90095-3","volume":"59","author":"P. Bosco","year":"1988","unstructured":"P. Bosco, E. Giovannetti, and C. Moiso. Narrowing vs. SLD-resolution. Theoretical Computer Science, 59:3\u201323, 1988.","journal-title":"Theoretical Computer Science"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0743-1066(93)90023-A","volume":"16","author":"A. Bossi","year":"1993","unstructured":"A. Bossi and N. Cocco. Basic Transformation Operations which preserve Computed Answer Substitutions of Logic Programs. Journal of Logic Programming, 16:47\u201387, 1993.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"1_CR7","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"R.M. Burstall and J. Darlington. A Transformation System for Developing Recursive Programs. Journal of the ACM, 24(1):44\u201367, 1977.","journal-title":"Journal of the ACM"},{"key":"1_CR8","first-page":"117","volume-title":"Proc. of the Int'l Workshop on Partial Evaluation and Mixed Computation","author":"J. Darlington","year":"1988","unstructured":"J. Darlington and H. Pull. A Program Development Methodology Based on a Unified Approach to Execution and Transformation. In D. Bj\u00f8rner, A.P. Ershov, and N.D. Jones, editors, Proc. of the Int'l Workshop on Partial Evaluation and Mixed Computation, pages 117\u2013131. North-Holland, Amsterdam, 1988."},{"issue":"1&2","key":"1_CR9","doi-asserted-by":"crossref","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(1&2):69\u2013115, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"1_CR10","first-page":"243","volume-title":"Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 243\u2013320. Elsevier, Amsterdam, 1990."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/S0747-7171(06)80002-7","volume":"15","author":"N. Dershowitz","year":"1993","unstructured":"N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467\u2013494, 1993.","journal-title":"Journal of Symbolic Computation"},{"key":"1_CR12","unstructured":"S. Etalle and M. Gabbrielli. Modular Transformations of CLP Programs. In Proc. of 12th Int'l Conf. on Logic Programming. The MIT Press, 1995."},{"key":"1_CR13","first-page":"172","volume-title":"Proc. of Second IEEE Int'l Symp. on Logic Programming","author":"L. Fribourg","year":"1985","unstructured":"L. Fribourg. SLOG: a logic programming language interpreter based on clausal superposition and rewriting. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 172\u2013185. IEEE, New York, 1985."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"M. Hanus. Efficient Implementation of Narrowing and Rewriting. In Proc. Int'l Workshop on Processing Declarative Knowledge, pages 344\u2013365. Springer LNAI 567, 1991.","DOI":"10.1007\/BFb0013543"},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19&20:583\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"M. Hanus. On Extra Variables in (Equational) Logic Programming. In Proc. of 20th Int'l Conf. on Logic Programming, pages 665\u2013678. The MIT Press, 1995.","DOI":"10.7551\/mitpress\/4298.003.0065"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler. Foundations of Equational Logic Programming. Springer LNAI 353, 1989.","DOI":"10.1007\/BFb0015791"},{"key":"1_CR18","unstructured":"T. Kawamura and T. Kanamori. Preservation of Stronger Equivalence in Unfold\/Fold Logic Programming Transformation. In Proc. Int'l Conf. on Fifth Generation Computer Systems, pages 413\u2013422. ICOT, 1988."},{"key":"1_CR19","unstructured":"J.W. Klop.Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume I, pages 1\u2013112. Oxford University Press, 1992."},{"key":"1_CR20","unstructured":"L. Kott. Unfold\/fold program transformation. In M. Nivat and J.C. Reynolds, editors, Algebraic methods in semantics, chapter 12, pages 411\u2013434. Cambridge University Press, 1985."},{"key":"1_CR21","first-page":"319","volume-title":"Proc. of the Joint International Conference and Symposium on Logic Programming JICSLP'96","author":"M. Leuschel","year":"1996","unstructured":"M. Leuschel, D. De Schreye, and A. de Waal. A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. In M. Maher, editor, Proc. of the Joint International Conference and Symposium on Logic Programming JICSLP'96, pages 319\u2013332. The MIT Press, Cambridge, MA, 1996."},{"key":"1_CR22","doi-asserted-by":"crossref","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. Journal of Logic Programming, 11:217\u2013242, 1991.","journal-title":"Journal of Logic Programming"},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01190830","volume":"5","author":"A. Middeldorp","year":"1994","unstructured":"A. Middeldorp and E. Hamoen. Completeness Results for Basic Narrowing. Applicable Algebra in Engineering, Communication and Computing, 5:213\u2013253, 1994.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"12","key":"1_CR24","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(96)00071-0","volume":"167","author":"A. Middeldorp","year":"1996","unstructured":"A. Middeldorp, S. Okui, and T. Ida. Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theoretical Computer Science, 167(1,2):95\u2013130, 1996.","journal-title":"Theoretical Computer Science"},{"key":"1_CR25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19","author":"A. Pettorossi","year":"1994","unstructured":"A. Pettorossi and M. Proietti. Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming, 19,20:261\u2013320, 1994.","journal-title":"Journal of Logic Programming"},{"key":"1_CR26","unstructured":"U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of 2nd Int'l Symp. on Logic Programming, pages 138\u2013151. IEEE, 1985."},{"issue":"1&2","key":"1_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0743-1066(93)90021-8","volume":"16","author":"H. Seki","year":"1993","unstructured":"H. Seki. Unfold\/fold Transformation of General Logic Programs for the Well-Founded Semantics. Journal of Logic Programming, 16(1&2):5\u201323, 1993.","journal-title":"Journal of Logic Programming"},{"key":"1_CR28","unstructured":"H. Tamaki and T. Sato. Unfold\/Fold Transformations of Logic Programs. In Proc. of 2nd Int'l Conf. on Logic Programming, pages 127\u2013139, 1984."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T23:19:44Z","timestamp":1706743184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634591","9783540695554"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0026999","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}