{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:35Z","timestamp":1725491615507},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752905"},{"type":"electronic","value":"9783540752929"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75292-9_12","type":"book-chapter","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T06:43:07Z","timestamp":1189492987000},"page":"169-184","source":"Crossref","is-referenced-by-count":3,"title":["A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees"],"prefix":"10.1007","author":[{"given":"Rafael","family":"del Vado V\u00edrseda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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":"12_CR2","doi-asserted-by":"crossref","unstructured":"del Vado V\u00edrseda, R.: A demand-driven narrowing calculus with overlapping definitional trees. In: PPDP, pp. 253\u2013263 (2003)","DOI":"10.1145\/888251.888275"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"del Vado V\u00edrseda, R.: Declarative constraint programming with definitional trees. In: FroCos, pp. 184\u2013199 (2005)","DOI":"10.1007\/11559306_10"},{"issue":"1","key":"12_CR4","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., Hortal\u00e1-Gonz\u00e1lez, M.T., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: An approach to declarative programming based on a rewriting logic. J. Log. Program.\u00a040(1), 47\u201387 (1999)","journal-title":"J. Log. Program."},{"key":"12_CR5","unstructured":"Gonz\u00e1lez-Moreno, J.C., Hortal\u00e1-Gonz\u00e1lez, M.T., Rodr\u00edguez-Artalejo, M.: A higher order rewriting logic for functional logic programming. In: ICLP, pp. 153\u2013167 (1997)"},{"key":"12_CR6","unstructured":"Hamada, M., Ida, T.: Implementation of lazy narrowing calculi in mathematica. Technical report, RISC, Johannes Kepler University, Austria (1997)"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1017\/S0956796899003330","volume":"9","author":"M. Hanus","year":"1999","unstructured":"Hanus, M., Prehofer, C.: Higher-order narrowing with definitional trees. J. Funct. Program.\u00a09(1), 33\u201375 (1999)","journal-title":"J. Funct. Program."},{"key":"12_CR8","volume-title":"Introduction to Combinatorics and \u03bb-Calculus","author":"J.R. Hindley","year":"1986","unstructured":"Hindley, J.R., Seldin, J.P.: Introduction to Combinatorics and \u03bb-Calculus. Cambridge University Press, Cambridge (1986)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/3-540-45654-6_38","volume-title":"Computer Aided Systems Theory - EUROCAST 2001","author":"T. Ida","year":"2001","unstructured":"Ida, T., Marin, M., Suzuki, T.: Higher-order lazy narrowing calculus: A solver for higher-order equations. In: Moreno-D\u00edaz Jr., R., Buchberger, B., Freire, J.-L. (eds.) EUROCAST 2001. LNCS, vol.\u00a02178, pp. 479\u2013493. Springer, Heidelberg (2001)"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. J. Log. Comput.\u00a01(4), 497\u2013536 (1991)","journal-title":"J. Log. Comput."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75292-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T20:50:29Z","timestamp":1556830229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75292-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540752905","9783540752929"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75292-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}