{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:23Z","timestamp":1725664703913},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60249-6_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:57:15Z","timestamp":1330279035000},"page":"233-242","source":"Crossref","is-referenced-by-count":0,"title":["Implementation of a UU-algorithm for primitive recursive tree functions"],"prefix":"10.1007","author":[{"given":"Heinz","family":"Fa\u00dfbender","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"R. Echahed. On completeness of narrowing strategies. In CAAP'88, pages 89\u2013101. Springer-Verlag, 1988. LNCS 299.","DOI":"10.1007\/BFb0026098"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(91)90353-4","volume":"78","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet and H. Vogler. Modular tree transducers. Theoretical Computer Science, 78:267\u2013304, 1991.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"18_CR3","first-page":"139","volume":"11","author":"H. Fa\u00dfbender","year":"1994","unstructured":"H. Fa\u00dfbender and H. Vogler. A universal unification algorithm based on unification-driven leftmost outermost narrowing. Acta Cybernetica, 11(3):139\u2013167, 1994.","journal-title":"Acta Cybernetica"},{"key":"18_CR4","volume-title":"Technical Report 94-04","author":"H. Fa\u00dfbender","year":"1994","unstructured":"H. Fa\u00dfbender, H. Vogler, and A. Wedel. Implementation of a deterministic partial E-unification algorithm for macro tree transducers. Technical Report 94-04, University of Ulm, Fakult\u00e4t f\u00fcr Informatik, D-89069 Ulm, Germany, 1994. accepted for publication in Electronic Journal of Functional and Logic Programming."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"W. Hans, R. Loogen, and S. Winkler. On the interaction of lazy evaluation and backtracking. In PLILP'92, pages 355\u2013369. Springer-Verlag, 1992. LNCS 631.","DOI":"10.1007\/3-540-55844-6_147"},{"issue":"20","key":"18_CR6","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":"18_CR7","volume-title":"Formal Language Theory: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"G. Huet and D.C. Oppen, Equations and rewrite rules: a survey. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems. Academic Press, New York, 1980."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"J.M. Hullot. Canonical forms and unification. In Proceedings of the 5th conference on automated deduction, pages 318\u2013334. Springer-Verlag, 1980. LNCS 87.","DOI":"10.21236\/ADA087640"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/502949.502880","volume":"6","author":"T. Johnsson","year":"1984","unstructured":"T. Johnsson. Efficient compilation of lazy evaluation. SIGPLAN Notices, 6:58\u201369, 1984.","journal-title":"SIGPLAN Notices"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages Systems, 4:258\u2013282, 1982.","journal-title":"ACM Transactions on Programming Languages Systems"},{"key":"18_CR11","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. Rodriguez-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":"18_CR12","unstructured":"U.S. Reddy. Narrowing as the operational semantics of functional languages. In Symposium on Logic Programming, pages 138\u2013151. IEEE Comp. Soc. Press, 1985."},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J.H. Siekmann","year":"1989","unstructured":"J.H. Siekmann. Unification theory. Journal of Symbolic Computation, 7:207\u2013274, 1989.","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:34:17Z","timestamp":1619573657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}