{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:21Z","timestamp":1761611301429},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_48","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:39:47Z","timestamp":1330292387000},"page":"138-152","source":"Crossref","is-referenced-by-count":13,"title":["Higher-order narrowing with definitional trees"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hanus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Prehofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"11_CR1","first-page":"143","volume":"632","author":"S. Antoy","year":"1992","unstructured":"S. Antoy. Definitional trees. In Proc. of the 3rd International Conference on Algebraic and Logic Programming, pages 143\u2013157. Springer LNCS 632, 1992.","journal-title":"Springer LNCS"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Proc. 21st ACM Symposium on Principles of Programming Languages, pages 268\u2013279, Portland, 1994.","DOI":"10.1145\/174675.177899"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1017\/S0960129500000566","volume":"4","author":"A. Asperti","year":"1994","unstructured":"Andrea Asperti and Cosimo Laneve. Interaction systems I: The theory of optimal reductions. Mathematical Structures in Computer Science, 4:457\u2013504, 1994.","journal-title":"Mathematical Structures in Computer Science"},{"key":"11_CR4","unstructured":"J. Avenhaus and C. A. Lor\u00eda-S\u00e1enz. Higher-order conditional rewriting and narrowing. In Jean-Pierre Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, M\u00fcnchen, Germany, September 1994. Springer LNCS 845."},{"key":"11_CR5","unstructured":"Hendrik Pieter Barendregt. The Lambda Calculus, its Syntax and Semantics. North Holland, 2nd edition, 1984."},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0022-0000(91)90009-T","volume":"42","author":"E. Giovannetti","year":"1991","unstructured":"E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel LEAF: A logic plus functional language. Journal of Computer and System Sciences, 42(2):139\u2013185, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR7","doi-asserted-by":"publisher","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":"11_CR8","first-page":"252","volume":"1048","author":"M. Hanus","year":"1995","unstructured":"M. Hanus. Efficient translation of lazy functional logic programs into Prolog. In Proc. Fifth International Workshop on Logic Program Synthesis and Transformation, pages 252\u2013266. Springer LNCS 1048, 1995.","journal-title":"Springer LNCS"},{"key":"11_CR9","volume-title":"Technical report 96-2","author":"M. Harms","year":"1996","unstructured":"M. Harms and C. Prehofer. Higher-order narrowing with definitional trees. Technical report 96-2, RWTH Aachen, 1996."},{"key":"11_CR10","unstructured":"J.R. Hindley and J. P. Seldin. Introduction to Combinators and \u03bb-Calculus. Cambridge University Press, 1986."},{"key":"11_CR11","volume-title":"Mathematical Centre Tracts 127","author":"J. W. Klop","year":"1980","unstructured":"Jan Willem Klop. Combinatory Reduction Systems. Mathematical Centre Tracts 127. Mathematisch Centrum, Amsterdam, 1980."},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation, 1:497\u2013536, 1991.","journal-title":"J. Logic and Computation"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0743-1066(92)90024-W","volume":"12","author":"J.J. Moreno-Navarro","year":"1992","unstructured":"J.J. Moreno-Navarro and M. Rodr\u00edguez-Artalejo. Logic programming with functions and predicates: The language BABEL. Journal of Logic Programming, 12:191\u2013223, 1992.","journal-title":"Journal of Logic Programming"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Tobias Nipkow. Higher-order critical pairs. In Proc. 6th IEEE Symp. Logic in Computer Science, pages 342\u2013349, 1991.","DOI":"10.1109\/LICS.1991.151658"},{"key":"11_CR15","volume-title":"PhD thesis","author":"V. Oostrom van","year":"1994","unstructured":"Vincent van Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, 1994. Amsterdam."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Vincent van Oostrom. Higher-order families, 1996. In this volume.","DOI":"10.1007\/3-540-61464-8_67"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Christian Prehofer. Higher-order narrowing. In Proc. Ninth Annual IEEE Symposium on Logic in Computer Science, pages 507\u2013516. IEEE Computer Society Press, 1994.","DOI":"10.1109\/LICS.1994.316040"},{"key":"11_CR18","unstructured":"Christian Prehofer. A Call-by-Need Strategy for Higher-Order Functional-Logic Programming. In J. Lloyd, editor, Logic Programming. Proc. of the 1995 International Symposium, pages 147\u2013161. MIT Press, 1995."},{"key":"11_CR19","unstructured":"Christian Prehofer. Solving Higher-order Equations: From Logic to Programming. PhD thesis, TU M\u00fcnchen, 1995. Also appeared as Technical Report I9508."},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J.R. Slagle","year":"1974","unstructured":"J.R. Slagle. Automated theorem-proving for theories with simplifiers, commutativity, and associativity. Journal of the ACM, 21(4):622\u2013642, 1974.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61464-8_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:28Z","timestamp":1605647188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}