{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:11Z","timestamp":1725456071444},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354058403X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016859","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:52:57Z","timestamp":1132732377000},"page":"269-284","source":"Crossref","is-referenced-by-count":3,"title":["Higher order conditional rewriting and narrowing"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Avenhaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Lor\u00eda-S\u00e1enz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"P. Aczel: A. general Church-Rosser theorem. Technical report, University of Manchester, 1978."},{"key":"20_CR2","unstructured":"J. Avenhaus, C. Lor\u00eda-S\u00e1enz: On conditional rewrite systems with extra variables and deterministic logic programs, to appear in Conf. on Logic Programming and Automated Reasoning (LPAR '94)"},{"key":"20_CR3","first-page":"1","volume-title":"Formal Techniques in Artifical Intelligence","author":"J. Avenhaus","year":"1990","unstructured":"J. Avenhaus, K. Madlener: Term rewriting and equational reasoning, 284 in: R.B. Banerji, ed., Formal Techniques in Artifical Intelligence, North Holland, Amsterdam, pp. 1\u201343, 1990."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"V. Breazu-Tannen: Combining algebra and higher order types. In Proc. 3rd IEEE Symp. Logic in Computer Science, 1988, pp. 82\u201390.","DOI":"10.1109\/LICS.1988.5103"},{"key":"20_CR5","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 Symbolic Computation, 3:69\u2013116, 1987.","journal-title":"Journal Symbolic Computation"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud: Rewrite systems. In J. van Leeuwen, editor, Formal Models and Semantics, Handbook of Theoretical Computer Science, Vol. B, pp. 243\u2013320. The MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(90)90064-O","volume":"75","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz, M. Okada: A Rationale for Conditional Equational Programming. Theoretical Computer Science, 75:111\u2013138, 1990","journal-title":"Theoretical Computer Science"},{"key":"20_CR8","unstructured":"J. Hindley, J. Seldin: Introduction to Combinators and \u03bb-Calculus. Cambridge University Press, 1986."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler: Foundations of Equational Logic Programming, volume 353 of Lectures Notes in Artificial Intelligence. Springer, 1989.","DOI":"10.1007\/BFb0015791"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"S. Kaplan: Simplifying conditional term rewriting systems: Unification termination and confluence, JSC, 1987, pp. 295\u2013334.","DOI":"10.1016\/S0747-7171(87)80010-X"},{"key":"20_CR11","volume-title":"Mathematical Centre Tracts 127","author":"J. Klop","year":"1980","unstructured":"J. Klop: Combinatory reduction systems. Mathematical Centre Tracts 127. Mathematisch Centrum, Amsterdam, 1980."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"C. Lor\u00eda-S\u00e1enz, J. Steinbach: Termintion of combined (rewrite systems and lambda-calculus) systems. In M. Rusinowitch and J.L. Remy, editors, Conditional Term Rewriting Systems, pp. 143\u2013147, LNCS 656, 1992.","DOI":"10.1007\/3-540-56393-8_10"},{"key":"20_CR13","unstructured":"C. Lor\u00eda-S\u00edenz: A theoretical framework for reasoning about program construction based on extensions of rewrite systems, Dissertation, Univ. Kaiserslautern, 1993."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"D. Miller: A logic programming language with lambda-abstraction, function variables, and simple unification. In P. Schroeder-Heister, editor, Extensions of Logic Programming, pp. 253\u2013281, LNCS 475, 1991.","DOI":"10.1007\/BFb0038698"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"A. Middeldorp, E. Hamoen: Counterexamples to completeness results for basic narrowing. In H. Kirchner, G. Levi, editors, Algebraic and Logic Programming, pp. 244\u2013258, LNCS 632.","DOI":"10.1007\/BFb0013830"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"T. Nipkow: Higher-order critical pairs. Symposium on Logic in Computer Science, pp. 342\u2013349, 1991.","DOI":"10.1109\/LICS.1991.151658"},{"key":"20_CR17","unstructured":"C. Prehofer: Higher-order narrowing. To appear in: Logic in Computer Science, 1994."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"D.A. Wolfram: The clausal theory of types, Cambridge University Press, Cambridge Tracts in Theoretical Computer Science, Vol. 21, 1993.","DOI":"10.1017\/CBO9780511569906"}],"container-title":["Lecture Notes in Computer Science","Constraints in Computational Logics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0016859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:38:17Z","timestamp":1586579897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354058403X"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0016859","relation":{},"subject":[]}}