{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:48Z","timestamp":1725559008162},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540214021"},{"type":"electronic","value":"9783540247548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24754-8_6","type":"book-chapter","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T16:28:24Z","timestamp":1278520104000},"page":"55-69","source":"Crossref","is-referenced-by-count":1,"title":["Analysing Definitional Trees: Looking for Determinism"],"prefix":"10.1007","author":[{"given":"Pascual","family":"Juli\u00e1n Iranzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Villamizar Lamus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1093\/logcom\/13.2.287","volume":"13","author":"M. Alpuente","year":"2003","unstructured":"Alpuente, M., Falaschi, M., Juli\u00e1n, P., Vidal, G.: Uniform Lazy Narrowing. Journal of Logic and Computation\u00a013(2), 27 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0013825","volume-title":"Algebraic and Logic Programming","author":"S. Antoy","year":"1992","unstructured":"Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol.\u00a0632, pp. 143\u2013157. Springer, Heidelberg (1992)"},{"key":"6_CR3","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":"6_CR4","series-title":"LNCS","volume-title":"Proc. of (PPDP 2001)","author":"S. Antoy","year":"2001","unstructured":"Antoy, S.: Constructor-based conditional narrowing. In: Proc. of (PPDP 2001). LNCS. Springer, Heidelberg (2001)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/3-540-61756-6_106","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"S. Antoy","year":"1996","unstructured":"Antoy, S.: Needed Narrowing in Prolog. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol.\u00a01140, pp. 473\u2013474. Springer, Heidelberg (1996)"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S. Antoy","year":"2000","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A Needed Narrowing Strategy. Journal of the ACM\u00a047(4), 776\u2013822 (2000)","journal-title":"Journal of the ACM"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/10720084_12","volume-title":"Frontiers of Combining Systems","author":"S. Antoy","year":"2000","unstructured":"Antoy, S., Hanus, M.: Compiling multi-paradigm declarative programs into Prolog. In: Kirchner, H. (ed.) FroCos 2000. LNCS, vol.\u00a01794, pp. 171\u2013185. Springer, Heidelberg (2000)"},{"unstructured":"Antoy, S., Engelke, M., Hanus, M., H\u00f6ppner, K., Koj, J., Niederau, P., Sadre, R., Steiner, F.: Packs 1.5: The Portland Aachen Kiel Curry System User Manual. Technical Report Version of May, 23, University of Kiel, Germany (2003), Available from \n                    \n                      http:\/\/www.informatik.uni-kiel.de\/~pakcs\/","key":"6_CR8"},{"key":"6_CR9","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)"},{"unstructured":"Gallagher, J., Bruynooghe, M.: Some Low-Level Source Transformations for Logic Programs. In: Proc. of 2nd Workshop on Meta-Programming in Logic, pp. 229\u2013246 (1990)","key":"6_CR10"},{"key":"6_CR11","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., Palamidessi, C.: Kernel Leaf: A Logic plus Functional Language. Journal of Computer and System Sciences\u00a042, 363\u2013377 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR12","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.: The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming\u00a019&20, 583\u2013628 (1994)","journal-title":"Journal of Logic Programming"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-60939-3_19","volume-title":"Logic Program Synthesis and Transformation","author":"M. Hanus","year":"1996","unstructured":"Hanus, M.: Efficient translation of lazy functional logic programs into Prolog. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol.\u00a01048, pp. 252\u2013266. Springer, Heidelberg (1996)"},{"unstructured":"Hanus, M., Huch, F.: An open system to support web-based learning. In: Proc. of WFLP 2003, pp. 269\u2013282. Universidad Polit\u00e9cnica de Valencia (2003)","key":"6_CR14"},{"unstructured":"Hanus, M. (ed.) Curry: An Integrated Functional Logic Language (1999), Available at \n                    \n                      http:\/\/www.informatik.uni-kiel.de\/~curry","key":"6_CR15"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-57186-8_79","volume-title":"Programming Language Implementation and Logic Programming","author":"R. Loogen","year":"1993","unstructured":"Loogen, R., L\u00f3pez-Fraguas, F., Rodr\u00edguez-Artalejo, M.: A Demand Driven Computation Strategy for Lazy Narrowing. In: Penjam, J., Bruynooghe, M. (eds.) PLILP 1993. LNCS, vol.\u00a0714, pp. 184\u2013200. Springer, Heidelberg (1993)"},{"key":"6_CR17","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)"},{"issue":"40","key":"6_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"1","author":"J.G. Moreno","year":"1999","unstructured":"Moreno, J.G., Gonz\u00e1lez, M.H., L\u00f3pez-Fraguas, F., Artalejo, M.R.: An Approach to Declarative Programming Based on a Rewriting Logic. Journal of Logic Programming\u00a01(40), 47\u201387 (1999)","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"6_CR19","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., Rodr\u00edguez-Artalejo, M.: Logic Programming with Functions and Predicates: The language Babel. Journal of Logic Programming\u00a012(3), 191\u2013224 (1992)","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0743-1066(94)00016-Y","volume":"23","author":"R. Ramesh","year":"1995","unstructured":"Ramesh, R., Ramakrishnan, I., Warren, D.: Automata\u2013Driven Indexing of Prolog Clauses. Journal of Logic Programming\u00a023(2), 151\u2013202 (1995)","journal-title":"Journal of Logic Programming"},{"unstructured":"Tamaki, H., Sato, T.: Unfold\/Fold Transformations of Logic Programs. In: Proc. of ICLP, pp. 127\u2013139 (1984)","key":"6_CR21"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24754-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T10:46:41Z","timestamp":1552819601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24754-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540214021","9783540247548"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24754-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}