{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:46Z","timestamp":1725455926886},"publisher-location":"Berlin\/Heidelberg","reference-count":22,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013829","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"228-243","source":"Crossref","is-referenced-by-count":3,"title":["Incremental rewriting in narrowing derivations"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hanus","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"P.G. Bosco, E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. A complete semantic characterization of K-LEAF, a logic language with partial functions. In Proc. 4th IEEE Internat. Symposium on Logic Programming, pp. 318\u2013327, San Francisco, 1987."},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(86)90014-2","volume":"3","author":"M. Bellia","year":"1986","unstructured":"M. Bellia and G. Levi. The Relation between Logic and Functional Languages: A Survey. Journal of Logic Programming (3), pp. 217\u2013236, 1986.","journal-title":"Journal of Logic Programming"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"P. Boizumault. A general model to implement dif and freeze. In Proc. Third International Conference on Logic Programming (London), pp. 585\u2013592. Springer LNCS 225, 1986.","DOI":"10.1007\/3-540-16492-8_107"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pp. 243\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"15_CR5","unstructured":"D. DeGroot and G. Lindstrom, editors. Logic Programming, Functions, Relations, and Equations. Prentice Hall, 1986."},{"key":"15_CR6","first-page":"161","volume-title":"First-Order Unification in an Equational Theory","author":"M.J. Fay","year":"1979","unstructured":"M.J. Fay. First-Order Unification in an Equational Theory. In Proc. 4th Workshop on Automated Deduction, pp. 161\u2013167, Austin (Texas), 1979. Academic Press."},{"key":"15_CR7","unstructured":"L. Fribourg. SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In Proc. IEEE Internat. Symposium on Logic Programming, pp. 172\u2013184, Boston, 1985."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"M. Hanus. Compiling Logic Programs with Equality. In Proc. of the 2nd Int. Workshop on Programming Language Implementation and Logic Programming, pp. 387\u2013401. Springer LNCS 456, 1990.","DOI":"10.1007\/BFb0024197"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"M. Hanus. Efficient Implementation of Narrowing and Rewriting. In Proc. Int. Workshop on Processing Declarative Knowledge, pp. 344\u2013365. Springer LNAI 567, 1991.","DOI":"10.1007\/BFb0013543"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"M. Hanus. Improving Control of Logic Programs by Using Functional Logic Languages. In Proc. of the 4th International Symposium on Programming Language Implementation and Logic Programming. Springer LNCS, 1992.","DOI":"10.1007\/3-540-55844-6_124"},{"key":"15_CR11","unstructured":"R. Harper, D.B. MacQueen, and R. Milner. Standard ML. LFCS Report Series ECS-LFCS-86-2, University of Edinburgh, 1986."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler. Foundations of Equational Logic Programming. Springer LNCS 353, 1989.","DOI":"10.1007\/BFb0015791"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"J.-M. Hullot. Canonical Forms and Unification. In Proc. 5th Conference on Automated Deduction, pp. 318\u2013334. Springer LNCS 87, 1980.","DOI":"10.21236\/ADA087640"},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0743-1066(89)90030-7","volume":"6","author":"A. Josephson","year":"1989","unstructured":"A. Josephson and N. Dershowitz. An Implementation of Narrowing. Journal of Logic Programming (6), pp. 57\u201377, 1989.","journal-title":"Journal of Logic Programming"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"R. Loogen. From Reduction Machines to Narrowing Machines. In Proc. of the TAPSOFT '91, pp. 438\u2013457. Springer LNCS 494, 1991.","DOI":"10.1007\/3540539816_80"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"J.J. Moreno-Navarro, H. Kuchen, R. Loogen, and M. Rodr\u00edguez-Artalejo. Lazy Narrowing in a Graph Machine. In Proc. Second International Conference on Algebraic and Logic Programming, pp. 298\u2013317. Springer LNCS 463, 1990.","DOI":"10.1007\/3-540-53162-9_47"},{"key":"15_CR17","doi-asserted-by":"crossref","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, Vol. 12, pp. 191\u2013223, 1992.","journal-title":"Journal of Logic Programming"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"L. Naish. Adding equations to NU-Prolog. In Proc. of the 3rd Int. Symposium on Programming Language Implementation and Logic Programming, pp. 15\u201326. Springer LNCS 528, 1991.","DOI":"10.1007\/3-540-54444-5_84"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"P. Rety. Improving basic narrowing techniques. In Proc. of the Conference on Rewriting Techniques and Applications, pp. 228\u2013241. Springer LNCS 256, 1987.","DOI":"10.1007\/3-540-17220-3_20"},{"issue":"No.4","key":"15_CR20","doi-asserted-by":"crossref","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, Vol. 21, No. 4, pp. 622\u2013642, 1974.","journal-title":"Journal of the ACM"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"D. Turner. Miranda: A non-strict functional language with polymorphic types. In Conference on Functional Programming Languages and Computer Architecture, Nancy, France, pp. 1\u201316. Springer LNCS 201, 1985.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"15_CR22","volume-title":"Technical Note 309","author":"D.H.D. Warren","year":"1983","unstructured":"D.H.D. Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI International, Stanford, 1983."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:33:30Z","timestamp":1586579610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0013829","relation":{},"subject":[]}}