{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:26Z","timestamp":1761611186218},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540368342"},{"type":"electronic","value":"9783540368359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11805618_4","type":"book-chapter","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T14:29:13Z","timestamp":1153837753000},"page":"35-49","source":"Crossref","is-referenced-by-count":7,"title":["On the Correctness of Bubbling"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel W.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Su-Hui","family":"Chiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1017\/S1471068404002303","volume":"5","author":"M. Alpuente","year":"2005","unstructured":"Alpuente, M., Hanus, M., Lucas, S., Vidal, G.: Specialization of functional logic programs based on needed narrowing. Theory and Practice of Logic Programming\u00a05(3), 273\u2013303 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0027000","volume-title":"Algebraic and Logic Programming","author":"S. Antoy","year":"1997","unstructured":"Antoy, S.: Optimal non-deterministic functional logic computations. In: Hanus, M., Heering, J., Meinke, K. (eds.) ALP 1997 and HOA 1997. LNCS, vol.\u00a01298, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/773184.773205","volume-title":"Proceedings of the Third ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming","author":"S. Antoy","year":"2001","unstructured":"Antoy, S.: Constructor-based conditional narrowing. In: Proceedings of the Third ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 199\u2013206. ACM Press, New York (2001)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.jsc.2004.12.007","volume":"40","author":"S. Antoy","year":"2005","unstructured":"Antoy, S.: Evaluation strategies for functional logic programming. Journal of Symbolic Computation\u00a040(1), 875\u2013903 (2005)","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Antoy, S., Brown, D., Chiang, S.: Lazy context cloning for non-deterministic graph rewriting. In: Proc. of the 3rd International Workshop on Term Graph Rewriting, Termgraph 2006, Vienna, Austria, pp. 61\u201370 (April 2006)","DOI":"10.1016\/j.entcs.2006.10.026"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11799573_9","volume-title":"Logic Programming","author":"S. Antoy","year":"2006","unstructured":"Antoy, S., Hanus, M.: Overlapping rules and logic variables in functional logic programs. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 87\u2013101. Springer, Heidelberg (to appear, 2006)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/11431664_7","volume-title":"Implementation and Application of Functional Languages","author":"S. Antoy","year":"2005","unstructured":"Antoy, S., Hanus, M., Liu, J., Tolmach, A.: A virtual machine for functional logic computations. In: Grelck, C., Huch, F., Michaelson, G.J., Trinder, P. (eds.) IFL 2004. LNCS, vol.\u00a03474, pp. 108\u2013125. Springer, Heidelberg (2005)"},{"key":"4_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"volume-title":"Term Rewriting Systems","year":"2003","key":"4_CR9","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"4_CR10","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 243\u2013320. Elsevier, Amsterdam (1990)"},{"key":"4_CR11","unstructured":"Echahed, R., Janodet, J.-C.: On constructor-based graph rewriting systems. Research Report 985-I, IMAG (1997)"},{"key":"4_CR12","first-page":"325","volume-title":"Proceedings of the Joint International Conference and Symposium on Logic Programming","author":"R. Echahed","year":"1998","unstructured":"Echahed, R., Janodet, J.-C.: Admissible graph rewriting and narrowing. In: Proceedings of the Joint International Conference and Symposium on Logic Programming, Manchester, June 1998, pp. 325\u2013340. MIT Press, Cambridge (1998)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"40","author":"J.C. Gonz\u00e1lez Moreno","year":"1999","unstructured":"Gonz\u00e1lez Moreno, J.C., L\u00f3pez Fraguas, F.J., Hortal\u00e1 Gonz\u00e1lez, M.T., Rodr\u00edguez Artalejo, M.: An approach to declarative programming based on a rewriting logic. The Journal of Logic Programming\u00a040, 47\u201387 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"4_CR14","unstructured":"Hanus, M. (ed.): PAKCS 1.7.1: The Portland Aachen Kiel Curry System (March 27, 2006), available at: http:\/\/www.informatik.uni-kiel.de\/~pakcs"},{"key":"4_CR15","unstructured":"Hanus, M. (ed.): Curry: An integrated functional logic language (vers.0.8.2) (March 28, 2006), available at: http:\/\/www.informatik.uni-kiel.de\/~curry"},{"key":"4_CR16","volume-title":"Computational logic: essays in honour of Alan Robinson","author":"G. Huet","year":"1991","unstructured":"Huet, G., L\u00e9vy, J.-J.: Computations in orthogonal term rewriting systems. In: Lassez, J.-L., Plotkin, G. (eds.) Computational logic: essays in honour of Alan Robinson. MIT Press, Cambridge (1991)"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0743-1066(92)90026-Y","volume":"12","author":"H. Hussmann","year":"1992","unstructured":"Hussmann, H.: Nondeterministic algebraic specifications and nonconfluent rewriting. Journal of Logic Programming\u00a012, 237\u2013255 (1992)","journal-title":"Journal of Logic Programming"},{"key":"4_CR18","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol.\u00a0II. Oxford University Press, Oxford (1992)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48685-2_19","volume-title":"Rewriting Techniques and Applications","author":"F. L\u00f3pez-Fraguas","year":"1999","unstructured":"L\u00f3pez-Fraguas, F., S\u00e1nchez-Hern\u00e1ndez, J.: TOY: A multiparadigm declarative system. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 244\u2013247. Springer, Heidelberg (1999)"},{"key":"4_CR20","volume-title":"Equational Logic as a Programming Language","author":"M.J. O\u2019Donnell","year":"1985","unstructured":"O\u2019Donnell, M.J.: Equational Logic as a Programming Language. MIT Press, Cambridge (1985)"},{"key":"4_CR21","first-page":"3","volume-title":"Handbook of Graph Grammars","author":"D. Plump","year":"1999","unstructured":"Plump, D.: Term graph rewriting. In: Kreowski, H.-J., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Handbook of Graph Grammars, vol.\u00a02, pp. 3\u201361. World Scientific, Singapore (1999)"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1016850.1016865","volume-title":"Proc. of the Ninth International Conference on Functional Programming (ICFP 2004)","author":"A. Tolmach","year":"2004","unstructured":"Tolmach, A., Antoy, S., Nita, M.: Implementing functional logic languages using multiple threads and stores. In: Proc. of the Ninth International Conference on Functional Programming (ICFP 2004), Snowbird, Utah, USA, pp. 90\u2013102. ACM Press, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11805618_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:12:49Z","timestamp":1605643969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11805618_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540368342","9783540368359"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11805618_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}