{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:15Z","timestamp":1725456015987},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354053010X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024173","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T09:49:34Z","timestamp":1132393774000},"page":"16-29","source":"Crossref","is-referenced-by-count":3,"title":["Compilation of narrowing"],"prefix":"10.1007","author":[{"given":"Andy","family":"M\u00fcck","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Bosco P. G., Giovannetti E., Moiso C.: Narrowing vs. SLD-resolution, Journal of Theoretic Computer Science, July 1988, pp. 3\u201323","DOI":"10.1016\/0304-3975(88)90095-3"},{"key":"2_CR2","unstructured":"Bosco P. G., Cecchi C., Moiso C.: An Extention of WAM for K-LEAF: A WAM-based Compilation of Conditional Narrowing. Proc. Int. Conf. on Logic Programming, pp. 318\u2013336, MIT Press, 1989"},{"key":"2_CR3","unstructured":"Deransart P.: An Operational Algebraic Semantics of Prolog Programs, Proc. Programmation en Logique, Perros-Guirec, CNET-Lannion, 1983"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-1-4615-8297-7_7","volume-title":"Advances in Data Base Theory, Vol. 1","author":"M. H. Emden van","year":"1981","unstructured":"van Emden M. H., Maibaum T.S.E.: Equations Compared with Clauses for Specification of Abstract Data Types. In: Gallaire H., Minka J., Nicolas J.M.: Advances in Data Base Theory, Vol. 1, pp. 159\u2013193, Plenum Press, New York, 1981"},{"key":"2_CR5","first-page":"325","volume":"202","author":"L. Fribourg","year":"1985","unstructured":"Fribourg L.: Handling Function Definitions through Innermost Superposition and Rewriting, Proc. RTA 85, LNCS 202, pp. 325\u2013344, Springer-Verlag, Berlin \u2014 New York 1985","journal-title":"LNCS"},{"key":"2_CR6","unstructured":"Fay M.: First Order Unification in an Equational Theory, Proc. 4th Workshop on Automated Deduction, Academic Press, 1979"},{"key":"2_CR7","first-page":"84","volume":"308","author":"A. Geser","year":"1987","unstructured":"Geser A., Hussmann H., M\u00fcck A.: A Compiler for a Class of Conditional Term Rewriting Systems, Proc. 1st. Int. Workshop of Conditional Term Rewriting Systems, Paris-Orsay, LNCS 308, pp. 84\u201390, 1987","journal-title":"LNCS"},{"key":"2_CR8","first-page":"318","volume":"87","author":"J. M. Hullot","year":"1980","unstructured":"Hullot J. M.: Canonical Forms and Unification, Proc. 5th CADE, LNCS 87, pp. 318\u2013324, Springer-Verlag, Berlin \u2014 New York 1980","journal-title":"LNCS"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Hussmann H.: Unification in Condition-Equational Theories, Research Report No. MIP-8502, Universit\u00e4t Passau 1985","DOI":"10.1007\/3-540-15984-3_328"},{"key":"2_CR10","first-page":"24","volume":"256","author":"S. Kaplan","year":"1987","unstructured":"Kaplan S.: A Compiler for Conditional Term Rewriting Systems, Proc. RTA 87, LNCS 256, pp. 24\u201341, 1987","journal-title":"LNCS"},{"issue":"87","key":"2_CR11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF03037460","volume":"5","author":"P. Kursawe","year":"1987","unstructured":"Kursawe P.: How to Invent a Prolog Machine, New Generation Computing, 5\/87, pp. 97\u2013114, Springer-Verlag, Berlin \u2014 New York, 1987","journal-title":"New Generation Computing"},{"key":"2_CR12","unstructured":"Hussmann H.: Rapid Prototyping for Algebraic Specifications, RAP-System User's Manual, Research Report No. MIP-8504, Universit\u00e4t Passau 1985"},{"key":"2_CR13","first-page":"141","volume":"202","author":"P. Rety","year":"1985","unstructured":"Rety P., Kirchner C., Kirchner H., Lescanne P.: NARROWER: A New Algorithm and Its Application to Logic Programming, Proc. RTA 85, LNCS 202, pp. 141\u2013157, Springer-Verlag, Berlin \u2014 New York 1985","journal-title":"LNCS"},{"issue":"1","key":"2_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson J.A.: A Machine Oriented Logic Based on the Resolution Principle, JACM, Vol. 12, No. 1, pp. 23\u201341, Jan. 1965","journal-title":"JACM"},{"key":"2_CR15","unstructured":"Warren D.H.D.: Implementing Prolog \u2014 Compiling Predicate Logic Programs, Vol. 1+2, Research Report No. 39, Department of AI, University of Edinburgh, 1977"},{"key":"2_CR16","unstructured":"Warren D.H.D.: An Abstract Prolog Instruction Set, SRI International, Technical Note 309, 1983"}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024173.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:52:10Z","timestamp":1607550730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354053010X"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0024173","relation":{},"subject":[]}}